YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 06:22:38,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 06:22:38,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 06:22:38,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 06:22:38,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 06:22:38,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 06:22:38,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 06:22:38,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 06:22:38,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 06:22:38,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 06:22:38,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 06:22:38,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 06:22:38,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 06:22:38,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 06:22:38,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 06:22:38,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 06:22:38,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 06:22:38,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 06:22:38,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 06:22:38,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 06:22:38,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 06:22:38,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 06:22:38,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 06:22:38,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 06:22:38,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 06:22:38,635 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 06:22:38,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 06:22:38,636 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 06:22:38,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 06:22:38,637 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 06:22:38,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 06:22:38,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 06:22:38,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 06:22:38,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 06:22:38,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 06:22:38,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 06:22:38,640 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 06:22:38,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 06:22:38,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 06:22:38,642 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 06:22:38,656 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 06:22:38,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 06:22:38,657 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 06:22:38,658 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 06:22:38,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 06:22:38,658 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:22:38,658 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 06:22:38,658 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 06:22:38,658 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 06:22:38,659 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 06:22:38,659 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 06:22:38,659 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 06:22:38,659 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 06:22:38,659 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 06:22:38,659 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:38,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 06:22:38,660 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 06:22:38,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 06:22:38,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 06:22:38,660 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 06:22:38,660 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 06:22:38,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 06:22:38,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 06:22:38,661 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 06:22:38,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:22:38,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 06:22:38,661 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 06:22:38,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 06:22:38,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 06:22:38,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 06:22:38,699 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 06:22:38,703 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 06:22:38,704 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 06:22:38,704 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 06:22:38,705 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 06:22:38,771 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/d4a4aa8c59114e848d1e8591e2d72c57/FLAG0e4b0a91d [2020-06-22 06:22:39,109 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 06:22:39,110 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 06:22:39,117 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/d4a4aa8c59114e848d1e8591e2d72c57/FLAG0e4b0a91d [2020-06-22 06:22:39,516 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/d4a4aa8c59114e848d1e8591e2d72c57 [2020-06-22 06:22:39,528 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 06:22:39,530 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 06:22:39,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 06:22:39,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 06:22:39,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 06:22:39,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eafdb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39, skipping insertion in model container [2020-06-22 06:22:39,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 06:22:39,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 06:22:39,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:22:39,727 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 06:22:39,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:22:39,822 INFO L195 MainTranslator]: Completed translation [2020-06-22 06:22:39,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39 WrapperNode [2020-06-22 06:22:39,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 06:22:39,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 06:22:39,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 06:22:39,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 06:22:39,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 06:22:39,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 06:22:39,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 06:22:39,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 06:22:39,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... [2020-06-22 06:22:39,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 06:22:39,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 06:22:39,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 06:22:39,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 06:22:39,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:22:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-06-22 06:22:39,946 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-06-22 06:22:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 06:22:39,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 06:22:40,069 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 06:22:40,070 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 06:22:40,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:22:40 BoogieIcfgContainer [2020-06-22 06:22:40,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 06:22:40,072 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 06:22:40,072 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 06:22:40,074 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 06:22:40,074 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:22:40" (1/1) ... [2020-06-22 06:22:40,090 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 17 edges [2020-06-22 06:22:40,091 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 06:22:40,092 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 06:22:40,093 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 06:22:40,093 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:22:40,095 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 06:22:40,096 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 06:22:40,096 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 06:22:40,109 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 06:22:40,116 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 06:22:40,121 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:22:40,123 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:22:40,133 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 06:22:40,135 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 06:22:40,137 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:22:40,137 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:22:40,137 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 06:22:40,138 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 06:22:40,138 INFO L313 BlockEncoder]: Encoded RCFG 10 locations, 13 edges [2020-06-22 06:22:40,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:22:40 BasicIcfg [2020-06-22 06:22:40,139 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 06:22:40,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 06:22:40,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 06:22:40,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 06:22:40,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 06:22:39" (1/4) ... [2020-06-22 06:22:40,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b427d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (2/4) ... [2020-06-22 06:22:40,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b427d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:22:40" (3/4) ... [2020-06-22 06:22:40,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b427d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:22:40" (4/4) ... [2020-06-22 06:22:40,147 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:22:40,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 06:22:40,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 06:22:40,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 06:22:40,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:22:40,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 06:22:40,210 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 06:22:40,210 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:22:40,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:22:40,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:22:40,211 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 06:22:40,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:22:40,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 06:22:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-06-22 06:22:40,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 06:22:40,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-06-22 06:22:40,302 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 5 9) the Hoare annotation is: true [2020-06-22 06:22:40,302 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 5 9) no Hoare annotation was computed. [2020-06-22 06:22:40,302 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 5 9) no Hoare annotation was computed. [2020-06-22 06:22:40,302 INFO L451 ceAbstractionStarter]: At program point L8(line 8) the Hoare annotation is: true [2020-06-22 06:22:40,303 INFO L451 ceAbstractionStarter]: At program point L8-1(line 8) the Hoare annotation is: true [2020-06-22 06:22:40,303 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 7) no Hoare annotation was computed. [2020-06-22 06:22:40,303 INFO L451 ceAbstractionStarter]: At program point L8-2(line 8) the Hoare annotation is: true [2020-06-22 06:22:40,303 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-06-22 06:22:40,304 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 06:22:40,304 INFO L451 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: true [2020-06-22 06:22:40,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:22:40 BasicIcfg [2020-06-22 06:22:40,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 06:22:40,308 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 06:22:40,308 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 06:22:40,312 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 06:22:40,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:22:40,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 06:22:39" (1/5) ... [2020-06-22 06:22:40,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7346fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:22:40,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:22:39" (2/5) ... [2020-06-22 06:22:40,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7346fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:22:40,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:22:40" (3/5) ... [2020-06-22 06:22:40,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7346fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:22:40,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:22:40" (4/5) ... [2020-06-22 06:22:40,316 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7346fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:22:40, skipping insertion in model container [2020-06-22 06:22:40,316 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:22:40,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:22:40" (5/5) ... [2020-06-22 06:22:40,318 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:22:40,346 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:22:40,347 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 06:22:40,347 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 06:22:40,347 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:22:40,347 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:22:40,347 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:22:40,347 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 06:22:40,348 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:22:40,348 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 06:22:40,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-06-22 06:22:40,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:22:40,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:22:40,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:22:40,379 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 06:22:40,379 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:22:40,379 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 06:22:40,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-06-22 06:22:40,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:22:40,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:22:40,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:22:40,382 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 06:22:40,382 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:22:40,387 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 10#L19true [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 6#rec1ENTRYtrue [2020-06-22 06:22:40,387 INFO L796 eck$LassoCheckResult]: Loop: 6#rec1ENTRYtrue [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 11#L6true [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 9#L8true [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 6#rec1ENTRYtrue [2020-06-22 06:22:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1920, now seen corresponding path program 1 times [2020-06-22 06:22:40,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:40,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:40,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:40,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash 55151, now seen corresponding path program 1 times [2020-06-22 06:22:40,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:40,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:40,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 57224080, now seen corresponding path program 1 times [2020-06-22 06:22:40,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:40,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:40,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:40,559 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:40,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:40,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:40,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:40,560 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:22:40,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:40,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:40,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:40,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:22:40,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:40,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:40,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:40,681 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:40,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:40,691 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:40,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:22:40,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:40,756 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:22:40,759 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:40,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:40,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:40,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:40,759 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:22:40,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:22:40,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:40,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:40,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:22:40,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:40,760 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:40,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:40,826 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:40,832 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:22:40,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:40,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:40,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:40,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:40,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:40,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:40,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:40,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:40,849 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:22:40,855 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-22 06:22:40,855 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:22:40,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:22:40,857 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:22:40,858 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:22:40,858 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-06-22 06:22:40,860 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:22:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:40,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:22:40,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:40,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:22:40,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:22:40,980 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 06:22:40,984 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 06:22:40,986 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states. Second operand 4 states. [2020-06-22 06:22:41,065 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 16 states. [2020-06-22 06:22:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 06:22:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:22:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-06-22 06:22:41,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 06:22:41,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:41,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 06:22:41,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:41,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 06:22:41,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:41,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2020-06-22 06:22:41,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:22:41,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 30 transitions. [2020-06-22 06:22:41,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 06:22:41,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 06:22:41,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-06-22 06:22:41,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:22:41,094 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 06:22:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-06-22 06:22:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2020-06-22 06:22:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 06:22:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-06-22 06:22:41,129 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-22 06:22:41,130 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-22 06:22:41,130 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 06:22:41,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-06-22 06:22:41,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:22:41,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:22:41,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:22:41,133 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 06:22:41,134 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 06:22:41,134 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 104#L19 [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 107#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 108#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 99#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 109#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 110#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 111#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 98#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 100#L8-1 [2020-06-22 06:22:41,135 INFO L796 eck$LassoCheckResult]: Loop: 100#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 112#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 114#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 102#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 112#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 114#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 105#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 113#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 100#L8-1 [2020-06-22 06:22:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:41,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1932213304, now seen corresponding path program 1 times [2020-06-22 06:22:41,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:41,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:41,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:41,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:41,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash 74335785, now seen corresponding path program 1 times [2020-06-22 06:22:41,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:41,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash -553495824, now seen corresponding path program 1 times [2020-06-22 06:22:41,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:41,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 06:22:41,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:22:41,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:22:41,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:41,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:22:41,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 06:22:41,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 06:22:41,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2020-06-22 06:22:41,384 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:41,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:41,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:41,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:41,385 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:22:41,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:41,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:41,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:41,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 06:22:41,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:41,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:41,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:41,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:41,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:41,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:41,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:41,480 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:41,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:41,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:41,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:41,490 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:41,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:41,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:41,521 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:41,521 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:41,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:41,552 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:41,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:22:41,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:43,260 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:22:43,264 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:43,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:43,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:43,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:43,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:22:43,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:22:43,265 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:43,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:43,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 06:22:43,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:43,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:43,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:43,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:43,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:43,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:43,321 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:43,321 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:22:43,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:43,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:43,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:43,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:43,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:43,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:43,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:43,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:43,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:43,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:43,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:43,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:43,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:43,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:43,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:43,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:43,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:43,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:43,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:43,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:43,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:43,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:43,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:43,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:43,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:43,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:43,342 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:22:43,349 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:22:43,349 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:22:43,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:22:43,349 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:22:43,349 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:22:43,350 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#t~ret0) = 1*rec1_#t~ret0 Supporting invariants [] [2020-06-22 06:22:43,350 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:22:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:43,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:22:43,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:43,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 06:22:43,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:22:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:43,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:22:43,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:43,642 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 06:22:43,643 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 10 loop predicates [2020-06-22 06:22:43,643 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 8 states. [2020-06-22 06:22:46,321 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 22 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 13989 states and 28369 transitions. Complement of second has 7508 states. [2020-06-22 06:22:46,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 18 non-accepting loop states 2 accepting loop states [2020-06-22 06:22:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 06:22:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2020-06-22 06:22:46,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 104 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 06:22:46,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:46,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 104 transitions. Stem has 17 letters. Loop has 8 letters. [2020-06-22 06:22:46,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:46,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 104 transitions. Stem has 9 letters. Loop has 16 letters. [2020-06-22 06:22:46,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:46,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13989 states and 28369 transitions. [2020-06-22 06:22:46,758 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2020-06-22 06:22:46,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13989 states to 277 states and 449 transitions. [2020-06-22 06:22:46,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2020-06-22 06:22:46,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2020-06-22 06:22:46,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 449 transitions. [2020-06-22 06:22:46,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:22:46,774 INFO L706 BuchiCegarLoop]: Abstraction has 277 states and 449 transitions. [2020-06-22 06:22:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 449 transitions. [2020-06-22 06:22:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2020-06-22 06:22:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-06-22 06:22:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 263 transitions. [2020-06-22 06:22:46,806 INFO L729 BuchiCegarLoop]: Abstraction has 171 states and 263 transitions. [2020-06-22 06:22:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 06:22:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 06:22:46,812 INFO L87 Difference]: Start difference. First operand 171 states and 263 transitions. Second operand 6 states. [2020-06-22 06:22:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:22:46,873 INFO L93 Difference]: Finished difference Result 161 states and 255 transitions. [2020-06-22 06:22:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 06:22:46,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 255 transitions. [2020-06-22 06:22:46,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2020-06-22 06:22:46,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 159 states and 252 transitions. [2020-06-22 06:22:46,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2020-06-22 06:22:46,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2020-06-22 06:22:46,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 252 transitions. [2020-06-22 06:22:46,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:22:46,888 INFO L706 BuchiCegarLoop]: Abstraction has 159 states and 252 transitions. [2020-06-22 06:22:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 252 transitions. [2020-06-22 06:22:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 123. [2020-06-22 06:22:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 06:22:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2020-06-22 06:22:46,901 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 184 transitions. [2020-06-22 06:22:46,901 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 184 transitions. [2020-06-22 06:22:46,901 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 06:22:46,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 184 transitions. [2020-06-22 06:22:46,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2020-06-22 06:22:46,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:22:46,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:22:46,904 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 06:22:46,904 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:22:46,905 INFO L794 eck$LassoCheckResult]: Stem: 22144#ULTIMATE.startENTRY [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 22145#L19 [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 22167#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22169#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 22178#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 22241#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22252#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 22255#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 22254#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 22148#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 22146#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22149#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 22166#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 22258#rec1EXIT >[40] rec1EXIT-->L8-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 22140#L8-2 [36] L8-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 22165#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22170#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 22171#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 22180#rec1ENTRY [2020-06-22 06:22:46,905 INFO L796 eck$LassoCheckResult]: Loop: 22180#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22221#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 22174#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 22180#rec1ENTRY [2020-06-22 06:22:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1324911227, now seen corresponding path program 1 times [2020-06-22 06:22:46,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:46,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:46,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:46,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:46,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 06:22:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:22:46,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 06:22:46,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 06:22:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash 55151, now seen corresponding path program 2 times [2020-06-22 06:22:46,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:46,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:46,989 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:46,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:46,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:46,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:46,990 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:22:46,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:46,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:46,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:46,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 06:22:46,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:46,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:46,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:47,097 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:47,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:47,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:47,108 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:47,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:47,144 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:47,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:47,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:47,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:47,193 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:47,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:47,241 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:47,242 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,272 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:47,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:47,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:47,276 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:47,304 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:47,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:22:47,336 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:47,366 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:22:47,368 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:47,368 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:47,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:47,368 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:47,368 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:22:47,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:22:47,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:47,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:47,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 06:22:47,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:47,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:47,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:47,425 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:47,426 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:22:47,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:47,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:47,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:47,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:47,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:47,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:47,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:47,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:47,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:47,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:47,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:47,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:47,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:47,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:47,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:47,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:47,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:47,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:47,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:47,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:47,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:47,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:47,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:47,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:47,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:47,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:47,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:47,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:47,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:47,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:47,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:47,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:47,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:47,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:47,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:47,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:47,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:47,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:47,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:47,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:47,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:47,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:47,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:47,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:47,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:47,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:47,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:47,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:47,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:47,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:47,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:47,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:47,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:47,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:22:47,448 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-22 06:22:47,448 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:22:47,449 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:22:47,449 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:22:47,449 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:22:47,449 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-06-22 06:22:47,449 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:22:47,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:47,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 06:22:47,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:47,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:22:47,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:22:47,598 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 06:22:47,598 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-06-22 06:22:47,598 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 184 transitions. cyclomatic complexity: 64 Second operand 5 states. [2020-06-22 06:22:47,781 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 184 transitions. cyclomatic complexity: 64. Second operand 5 states. Result 354 states and 433 transitions. Complement of second has 48 states. [2020-06-22 06:22:47,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 06:22:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:22:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-06-22 06:22:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2020-06-22 06:22:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 21 letters. Loop has 3 letters. [2020-06-22 06:22:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 18 letters. Loop has 6 letters. [2020-06-22 06:22:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:47,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 433 transitions. [2020-06-22 06:22:47,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2020-06-22 06:22:47,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 164 states and 241 transitions. [2020-06-22 06:22:47,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2020-06-22 06:22:47,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2020-06-22 06:22:47,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 241 transitions. [2020-06-22 06:22:47,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:22:47,797 INFO L706 BuchiCegarLoop]: Abstraction has 164 states and 241 transitions. [2020-06-22 06:22:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 241 transitions. [2020-06-22 06:22:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2020-06-22 06:22:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-06-22 06:22:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 193 transitions. [2020-06-22 06:22:47,810 INFO L729 BuchiCegarLoop]: Abstraction has 134 states and 193 transitions. [2020-06-22 06:22:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 06:22:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 06:22:47,810 INFO L87 Difference]: Start difference. First operand 134 states and 193 transitions. Second operand 6 states. [2020-06-22 06:22:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:22:47,868 INFO L93 Difference]: Finished difference Result 153 states and 212 transitions. [2020-06-22 06:22:47,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 06:22:47,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 212 transitions. [2020-06-22 06:22:47,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 06:22:47,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 148 states and 203 transitions. [2020-06-22 06:22:47,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2020-06-22 06:22:47,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2020-06-22 06:22:47,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 203 transitions. [2020-06-22 06:22:47,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:22:47,876 INFO L706 BuchiCegarLoop]: Abstraction has 148 states and 203 transitions. [2020-06-22 06:22:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 203 transitions. [2020-06-22 06:22:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 137. [2020-06-22 06:22:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-06-22 06:22:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2020-06-22 06:22:47,883 INFO L729 BuchiCegarLoop]: Abstraction has 137 states and 187 transitions. [2020-06-22 06:22:47,884 INFO L609 BuchiCegarLoop]: Abstraction has 137 states and 187 transitions. [2020-06-22 06:22:47,884 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 06:22:47,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 187 transitions. [2020-06-22 06:22:47,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 06:22:47,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:22:47,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:22:47,886 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 06:22:47,886 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:22:47,887 INFO L794 eck$LassoCheckResult]: Stem: 23055#ULTIMATE.startENTRY [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 23056#L19 [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 23070#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23146#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23127#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23143#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23149#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23128#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23129#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23148#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 23147#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23144#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 23139#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 23141#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23145#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 23142#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23138#rec1EXIT >[40] rec1EXIT-->L8-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 23133#L8-2 [36] L8-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 23135#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23150#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 23136#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23132#rec1EXIT >[39] rec1EXIT-->L8-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 23131#L8-3 [31] L8-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 23130#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23126#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 23086#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 23116#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23160#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23120#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23121#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23124#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23119#L8 [2020-06-22 06:22:47,887 INFO L796 eck$LassoCheckResult]: Loop: 23119#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23123#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23124#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23119#L8 [2020-06-22 06:22:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash 37993876, now seen corresponding path program 1 times [2020-06-22 06:22:47,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:47,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:47,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:47,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:22:47,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-06-22 06:22:47,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:22:47,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:22:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:47,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:22:47,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-06-22 06:22:48,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:22:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 06:22:48,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 06:22:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash 62321, now seen corresponding path program 3 times [2020-06-22 06:22:48,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:22:48,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:22:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:22:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:22:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:22:48,069 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:48,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:48,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:48,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:48,070 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:22:48,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:48,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:48,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 06:22:48,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:48,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:48,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:48,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:48,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:48,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:48,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:48,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:48,122 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:48,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:48,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:48,131 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:48,166 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:48,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:48,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:48,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:48,206 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:48,206 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:48,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:48,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:22:48,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:22:48,279 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:22:48,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:22:48,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:22:53,022 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:22:53,025 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:22:53,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:22:53,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:22:53,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:22:53,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:22:53,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:22:53,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:22:53,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:22:53,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 06:22:53,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:22:53,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:22:53,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:53,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:53,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:53,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:53,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:22:53,070 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:22:53,071 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:22:53,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:53,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:53,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:53,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:53,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:53,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:53,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:53,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:53,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:53,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:53,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:53,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:53,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:53,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:53,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:53,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:53,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:53,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:53,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:53,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:53,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:53,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:53,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:53,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:53,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:53,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:53,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:53,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:53,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:53,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:53,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:53,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:53,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:53,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:53,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:53,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:22:53,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:22:53,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:22:53,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:22:53,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:22:53,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:22:53,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:22:53,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:22:53,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:22:53,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:22:53,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:22:53,091 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:22:53,092 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:22:53,092 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:22:53,092 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:22:53,092 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_~i) = 1*rec1_~i Supporting invariants [] [2020-06-22 06:22:53,092 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:22:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:22:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:53,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 06:22:53,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:53,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:22:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:22:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:22:53,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:22:53,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:22:53,334 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 06:22:53,335 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2020-06-22 06:22:53,335 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 137 states and 187 transitions. cyclomatic complexity: 52 Second operand 5 states. [2020-06-22 06:22:53,442 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 137 states and 187 transitions. cyclomatic complexity: 52. Second operand 5 states. Result 352 states and 467 transitions. Complement of second has 76 states. [2020-06-22 06:22:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 06:22:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:22:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-06-22 06:22:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 31 letters. Loop has 3 letters. [2020-06-22 06:22:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 34 letters. Loop has 3 letters. [2020-06-22 06:22:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:53,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 31 letters. Loop has 6 letters. [2020-06-22 06:22:53,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:22:53,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 467 transitions. [2020-06-22 06:22:53,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-06-22 06:22:53,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 167 states and 235 transitions. [2020-06-22 06:22:53,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-06-22 06:22:53,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2020-06-22 06:22:53,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 235 transitions. [2020-06-22 06:22:53,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:22:53,454 INFO L706 BuchiCegarLoop]: Abstraction has 167 states and 235 transitions. [2020-06-22 06:22:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 235 transitions. [2020-06-22 06:22:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2020-06-22 06:22:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-06-22 06:22:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2020-06-22 06:22:53,460 INFO L729 BuchiCegarLoop]: Abstraction has 137 states and 187 transitions. [2020-06-22 06:22:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 06:22:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 06:22:53,461 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand 8 states. [2020-06-22 06:22:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:22:53,540 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-06-22 06:22:53,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 06:22:53,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2020-06-22 06:22:53,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:22:53,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-06-22 06:22:53,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 06:22:53,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 06:22:53,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 06:22:53,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:22:53,544 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:22:53,544 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:22:53,544 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:22:53,544 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 06:22:53,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 06:22:53,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:22:53,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 06:22:53,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:22:53 BasicIcfg [2020-06-22 06:22:53,551 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 06:22:53,551 INFO L168 Benchmark]: Toolchain (without parser) took 14023.03 ms. Allocated memory was 649.6 MB in the beginning and 887.6 MB in the end (delta: 238.0 MB). Free memory was 565.1 MB in the beginning and 397.5 MB in the end (delta: 167.6 MB). Peak memory consumption was 405.6 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,553 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:22:53,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.06 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 565.1 MB in the beginning and 636.7 MB in the end (delta: -71.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.25 ms. Allocated memory is still 672.7 MB. Free memory was 636.7 MB in the beginning and 635.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,555 INFO L168 Benchmark]: Boogie Preprocessor took 15.86 ms. Allocated memory is still 672.7 MB. Free memory was 635.6 MB in the beginning and 634.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,555 INFO L168 Benchmark]: RCFGBuilder took 196.71 ms. Allocated memory is still 672.7 MB. Free memory was 634.5 MB in the beginning and 621.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,556 INFO L168 Benchmark]: BlockEncodingV2 took 67.20 ms. Allocated memory is still 672.7 MB. Free memory was 621.1 MB in the beginning and 616.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,556 INFO L168 Benchmark]: TraceAbstraction took 167.74 ms. Allocated memory is still 672.7 MB. Free memory was 615.7 MB in the beginning and 604.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,556 INFO L168 Benchmark]: BuchiAutomizer took 13242.80 ms. Allocated memory was 672.7 MB in the beginning and 887.6 MB in the end (delta: 215.0 MB). Free memory was 604.8 MB in the beginning and 397.5 MB in the end (delta: 207.2 MB). Peak memory consumption was 422.2 MB. Max. memory is 50.3 GB. [2020-06-22 06:22:53,560 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 17 edges - StatisticsResult: Encoded RCFG 10 locations, 13 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 293.06 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 565.1 MB in the beginning and 636.7 MB in the end (delta: -71.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.25 ms. Allocated memory is still 672.7 MB. Free memory was 636.7 MB in the beginning and 635.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 15.86 ms. Allocated memory is still 672.7 MB. Free memory was 635.6 MB in the beginning and 634.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 196.71 ms. Allocated memory is still 672.7 MB. Free memory was 634.5 MB in the beginning and 621.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 67.20 ms. Allocated memory is still 672.7 MB. Free memory was 621.1 MB in the beginning and 616.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 167.74 ms. Allocated memory is still 672.7 MB. Free memory was 615.7 MB in the beginning and 604.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 13242.80 ms. Allocated memory was 672.7 MB in the beginning and 887.6 MB in the end (delta: 215.0 MB). Free memory was 604.8 MB in the beginning and 397.5 MB in the end (delta: 207.2 MB). Peak memory consumption was 422.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 17 PreInvPairs, 17 NumberOfFragments, 5 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a2f5e04 and consists of 23 locations. One nondeterministic module has affine ranking function \old(i) and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.2s and 5 iterations. TraceHistogramMax:7. Analysis of lassos took 8.4s. Construction of modules took 0.4s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 137 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 102 SDtfs, 130 SDslu, 263 SDs, 0 SdLazy, 373 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq167 hnf92 smp100 dnf100 smp100 tf110 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 06:22:36.291 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 06:22:53.794 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check