NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 03:03:40,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 03:03:40,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 03:03:40,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 03:03:40,717 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 03:03:40,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 03:03:40,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 03:03:40,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 03:03:40,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 03:03:40,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 03:03:40,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 03:03:40,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 03:03:40,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 03:03:40,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 03:03:40,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 03:03:40,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 03:03:40,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 03:03:40,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 03:03:40,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 03:03:40,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 03:03:40,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 03:03:40,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 03:03:40,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 03:03:40,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 03:03:40,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 03:03:40,739 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 03:03:40,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 03:03:40,740 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 03:03:40,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 03:03:40,741 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 03:03:40,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 03:03:40,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 03:03:40,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 03:03:40,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 03:03:40,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 03:03:40,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 03:03:40,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 03:03:40,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 03:03:40,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 03:03:40,746 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 03:03:40,759 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 03:03:40,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 03:03:40,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 03:03:40,761 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 03:03:40,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 03:03:40,761 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:03:40,762 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 03:03:40,762 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 03:03:40,762 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 03:03:40,762 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 03:03:40,762 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 03:03:40,762 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 03:03:40,763 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 03:03:40,763 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 03:03:40,763 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:40,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 03:03:40,763 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 03:03:40,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 03:03:40,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 03:03:40,764 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 03:03:40,764 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 03:03:40,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 03:03:40,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 03:03:40,765 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 03:03:40,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:03:40,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 03:03:40,765 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 03:03:40,765 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 03:03:40,765 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 03:03:40,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 03:03:40,803 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 03:03:40,806 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 03:03:40,807 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 03:03:40,808 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 03:03:40,808 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 03:03:40,876 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/66bef08ec74b4a1594e92ae57c0a4597/FLAG5cd903559 [2020-06-22 03:03:41,201 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 03:03:41,202 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 03:03:41,208 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/66bef08ec74b4a1594e92ae57c0a4597/FLAG5cd903559 [2020-06-22 03:03:41,618 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/66bef08ec74b4a1594e92ae57c0a4597 [2020-06-22 03:03:41,630 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 03:03:41,631 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 03:03:41,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 03:03:41,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 03:03:41,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 03:03:41,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405e6761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41, skipping insertion in model container [2020-06-22 03:03:41,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 03:03:41,665 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 03:03:41,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:03:41,821 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 03:03:41,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:03:41,908 INFO L195 MainTranslator]: Completed translation [2020-06-22 03:03:41,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41 WrapperNode [2020-06-22 03:03:41,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 03:03:41,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 03:03:41,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 03:03:41,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 03:03:41,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 03:03:41,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 03:03:41,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 03:03:41,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 03:03:41,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... [2020-06-22 03:03:41,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 03:03:41,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 03:03:41,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 03:03:41,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 03:03:41,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 03:03:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 03:03:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 03:03:42,175 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 03:03:42,176 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 03:03:42,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:03:42 BoogieIcfgContainer [2020-06-22 03:03:42,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 03:03:42,178 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 03:03:42,178 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 03:03:42,180 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 03:03:42,181 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:03:42" (1/1) ... [2020-06-22 03:03:42,197 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-06-22 03:03:42,199 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 03:03:42,200 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 03:03:42,200 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 03:03:42,201 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:03:42,202 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 03:03:42,203 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 03:03:42,204 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 03:03:42,220 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 03:03:42,237 INFO L200 BlockEncoder]: SBE split 3 edges [2020-06-22 03:03:42,243 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 03:03:42,244 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:03:42,259 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 03:03:42,262 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 03:03:42,263 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:03:42,263 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:03:42,264 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 03:03:42,264 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:03:42,264 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-06-22 03:03:42,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:03:42 BasicIcfg [2020-06-22 03:03:42,265 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 03:03:42,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 03:03:42,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 03:03:42,269 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 03:03:42,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 03:03:41" (1/4) ... [2020-06-22 03:03:42,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d404d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (2/4) ... [2020-06-22 03:03:42,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d404d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:03:42" (3/4) ... [2020-06-22 03:03:42,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d404d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:03:42" (4/4) ... [2020-06-22 03:03:42,273 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:03:42,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 03:03:42,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 03:03:42,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 03:03:42,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:03:42,341 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 03:03:42,341 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 03:03:42,341 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:03:42,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:03:42,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:03:42,342 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 03:03:42,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:03:42,342 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 03:03:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 03:03:42,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 03:03:42,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 03:03:42,414 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 11 23) the Hoare annotation is: true [2020-06-22 03:03:42,414 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 11 23) no Hoare annotation was computed. [2020-06-22 03:03:42,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 03:03:42,415 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 03:03:42,415 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 23) no Hoare annotation was computed. [2020-06-22 03:03:42,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:03:42 BasicIcfg [2020-06-22 03:03:42,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 03:03:42,425 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 03:03:42,425 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 03:03:42,428 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 03:03:42,429 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:03:42,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 03:03:41" (1/5) ... [2020-06-22 03:03:42,430 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c74db41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,430 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:03:42,430 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:03:41" (2/5) ... [2020-06-22 03:03:42,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c74db41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:03:42,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:03:42" (3/5) ... [2020-06-22 03:03:42,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c74db41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:03:42,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:03:42" (4/5) ... [2020-06-22 03:03:42,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c74db41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:03:42, skipping insertion in model container [2020-06-22 03:03:42,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:03:42,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:03:42" (5/5) ... [2020-06-22 03:03:42,434 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:03:42,462 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:03:42,462 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 03:03:42,462 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 03:03:42,462 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:03:42,463 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:03:42,463 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:03:42,463 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 03:03:42,463 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:03:42,463 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 03:03:42,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 03:03:42,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:03:42,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:42,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:42,492 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:03:42,493 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:03:42,493 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 03:03:42,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 03:03:42,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:03:42,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:42,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:42,494 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:03:42,494 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:03:42,500 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5#L18-1true [2020-06-22 03:03:42,500 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6#L12true [53] L12-->L12-2: Formula: (> 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3#L12-2true [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 7#L15-1true [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L18-1true [2020-06-22 03:03:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-06-22 03:03:42,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:42,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:42,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2197058, now seen corresponding path program 1 times [2020-06-22 03:03:42,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:42,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:42,623 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 03:03:42,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:03:42,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 03:03:42,630 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:03:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:03:42,647 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2020-06-22 03:03:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:42,681 INFO L93 Difference]: Finished difference Result 6 states and 11 transitions. [2020-06-22 03:03:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:03:42,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 11 transitions. [2020-06-22 03:03:42,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 03:03:42,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 11 transitions. [2020-06-22 03:03:42,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 03:03:42,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 03:03:42,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 11 transitions. [2020-06-22 03:03:42,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:03:42,692 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 11 transitions. [2020-06-22 03:03:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 11 transitions. [2020-06-22 03:03:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. [2020-06-22 03:03:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:03:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-06-22 03:03:42,721 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. [2020-06-22 03:03:42,722 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. [2020-06-22 03:03:42,722 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 03:03:42,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 10 transitions. [2020-06-22 03:03:42,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:03:42,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:42,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:42,723 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:03:42,723 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:03:42,724 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 23#L18-1 [2020-06-22 03:03:42,724 INFO L796 eck$LassoCheckResult]: Loop: 23#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 24#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 21#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 23#L18-1 [2020-06-22 03:03:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2020-06-22 03:03:42,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:42,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2198019, now seen corresponding path program 1 times [2020-06-22 03:03:42,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:42,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:42,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:42,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash 64997447, now seen corresponding path program 1 times [2020-06-22 03:03:42,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:42,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:42,805 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:42,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:42,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:42,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:42,807 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:03:42,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:42,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:42,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:42,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 03:03:42,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:42,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:42,825 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 03:03:42,833 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 03:03:42,837 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 03:03:42,840 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 03:03:42,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:42,930 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 03:03:42,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:42,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:42,971 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:42,971 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 03:03:42,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:42,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:43,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:43,008 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:43,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:43,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:43,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:43,025 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 03:03:43,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:43,052 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 03:03:43,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:03:43,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:43,089 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:03:43,114 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:43,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:43,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:43,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:43,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:03:43,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:03:43,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:43,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:43,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 03:03:43,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:43,115 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:43,117 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 03:03:43,120 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 03:03:43,123 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 03:03:43,127 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 03:03:43,201 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:43,207 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:03:43,208 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 03:03:43,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:43,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:43,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:43,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:43,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:03:43,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:03:43,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:43,222 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 03:03:43,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:43,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:43,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:43,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:43,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:03:43,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:03:43,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:43,234 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 03:03:43,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:43,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:43,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:43,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:43,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:43,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:43,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:43,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:43,240 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 03:03:43,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:43,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:43,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:43,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:43,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:43,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:43,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:43,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:03:43,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:03:43,253 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:03:43,255 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:03:43,255 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:03:43,256 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:03:43,256 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 03:03:43,257 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:03:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:43,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:43,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:43,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:43,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:43,314 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 03:03:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:43,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:43,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:43,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:43,450 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 03:03:43,453 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 5 loop predicates [2020-06-22 03:03:43,454 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 10 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-06-22 03:03:43,698 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 10 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 55 states and 114 transitions. Complement of second has 16 states. [2020-06-22 03:03:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states [2020-06-22 03:03:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:03:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-06-22 03:03:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 03:03:43,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:43,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 03:03:43,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:43,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 1 letters. Loop has 8 letters. [2020-06-22 03:03:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:43,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 114 transitions. [2020-06-22 03:03:43,715 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2020-06-22 03:03:43,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 43 states and 85 transitions. [2020-06-22 03:03:43,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 03:03:43,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 03:03:43,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 85 transitions. [2020-06-22 03:03:43,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:43,718 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 85 transitions. [2020-06-22 03:03:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 85 transitions. [2020-06-22 03:03:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2020-06-22 03:03:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 03:03:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2020-06-22 03:03:43,725 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 76 transitions. [2020-06-22 03:03:43,725 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 76 transitions. [2020-06-22 03:03:43,725 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 03:03:43,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 76 transitions. [2020-06-22 03:03:43,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2020-06-22 03:03:43,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:43,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:43,727 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:03:43,727 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:03:43,728 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 168#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 180#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 194#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 190#L15-1 [2020-06-22 03:03:43,728 INFO L796 eck$LassoCheckResult]: Loop: 190#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 189#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 192#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 191#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 190#L15-1 [2020-06-22 03:03:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2096337, now seen corresponding path program 1 times [2020-06-22 03:03:43,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:43,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:43,745 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 03:03:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:03:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 03:03:43,746 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 03:03:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2305227, now seen corresponding path program 1 times [2020-06-22 03:03:43,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:43,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:43,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:43,785 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:43,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:43,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:43,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:43,786 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:03:43,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:43,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:43,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:43,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 03:03:43,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:43,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:43,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 03:03:43,793 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 03:03:43,796 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 03:03:43,809 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 03:03:43,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:43,891 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 03:03:43,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:43,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:43,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:43,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 03:03:43,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:43,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:43,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:43,969 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 03:03:43,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:43,980 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 03:03:44,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:03:44,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:44,146 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:03:44,149 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:44,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:44,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:44,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:44,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:03:44,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:03:44,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:44,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:44,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 03:03:44,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:44,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:44,152 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 03:03:44,156 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 03:03:44,163 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 03:03:44,166 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 03:03:44,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:44,233 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:03:44,234 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 03:03:44,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:44,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:44,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:44,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:44,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:03:44,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:03:44,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:44,241 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 03:03:44,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:44,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:44,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:44,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:44,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:44,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:44,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:44,249 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:03:44,252 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:03:44,252 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:03:44,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:03:44,253 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:03:44,253 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:03:44,253 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-06-22 03:03:44,254 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:03:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:44,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:44,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:44,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:44,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:44,327 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 03:03:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:44,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:44,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:44,787 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 19 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true [2020-06-22 03:03:45,237 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:03:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:45,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:45,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:45,689 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 03:03:45,689 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 5 loop predicates [2020-06-22 03:03:45,689 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 76 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-06-22 03:03:45,908 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 76 transitions. cyclomatic complexity: 44. Second operand 3 states. Result 605 states and 1138 transitions. Complement of second has 51 states. [2020-06-22 03:03:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 03:03:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:03:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-06-22 03:03:45,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 03:03:45,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:45,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 03:03:45,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:45,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 03:03:45,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:45,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 1138 transitions. [2020-06-22 03:03:45,931 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 119 [2020-06-22 03:03:45,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 195 states and 348 transitions. [2020-06-22 03:03:45,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2020-06-22 03:03:45,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2020-06-22 03:03:45,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 348 transitions. [2020-06-22 03:03:45,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:45,936 INFO L706 BuchiCegarLoop]: Abstraction has 195 states and 348 transitions. [2020-06-22 03:03:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 348 transitions. [2020-06-22 03:03:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2020-06-22 03:03:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-06-22 03:03:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 281 transitions. [2020-06-22 03:03:45,951 INFO L729 BuchiCegarLoop]: Abstraction has 146 states and 281 transitions. [2020-06-22 03:03:45,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:03:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:03:45,952 INFO L87 Difference]: Start difference. First operand 146 states and 281 transitions. Second operand 3 states. [2020-06-22 03:03:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:45,984 INFO L93 Difference]: Finished difference Result 171 states and 301 transitions. [2020-06-22 03:03:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:03:45,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 301 transitions. [2020-06-22 03:03:45,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 [2020-06-22 03:03:45,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 301 transitions. [2020-06-22 03:03:45,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2020-06-22 03:03:45,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-06-22 03:03:45,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 301 transitions. [2020-06-22 03:03:45,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:45,992 INFO L706 BuchiCegarLoop]: Abstraction has 171 states and 301 transitions. [2020-06-22 03:03:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 301 transitions. [2020-06-22 03:03:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2020-06-22 03:03:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-06-22 03:03:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 289 transitions. [2020-06-22 03:03:46,003 INFO L729 BuchiCegarLoop]: Abstraction has 161 states and 289 transitions. [2020-06-22 03:03:46,003 INFO L609 BuchiCegarLoop]: Abstraction has 161 states and 289 transitions. [2020-06-22 03:03:46,003 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 03:03:46,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 289 transitions. [2020-06-22 03:03:46,005 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 99 [2020-06-22 03:03:46,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:46,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:46,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:03:46,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:03:46,006 INFO L794 eck$LassoCheckResult]: Stem: 1243#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1244#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1331#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1384#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1391#L15-1 [2020-06-22 03:03:46,006 INFO L796 eck$LassoCheckResult]: Loop: 1391#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1397#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1395#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1392#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1391#L15-1 [2020-06-22 03:03:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 1 times [2020-06-22 03:03:46,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:46,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:46,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2305227, now seen corresponding path program 2 times [2020-06-22 03:03:46,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:46,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:46,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash -691623300, now seen corresponding path program 1 times [2020-06-22 03:03:46,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:46,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:46,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:46,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:03:46,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:03:46,062 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:46,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:46,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:46,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:46,062 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:03:46,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:46,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:46,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:46,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 03:03:46,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:46,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:46,064 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 03:03:46,078 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 03:03:46,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 03:03:46,086 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 03:03:46,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:46,137 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 03:03:46,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:46,140 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 03:03:46,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:03:46,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:46,305 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:03:46,308 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:46,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:46,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:46,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:46,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:03:46,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:03:46,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:46,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:46,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 03:03:46,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:46,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:46,310 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 03:03:46,316 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 03:03:46,319 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 03:03:46,323 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 03:03:46,369 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:46,369 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:03:46,369 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 03:03:46,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:46,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:46,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:46,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:46,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:46,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:46,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:46,376 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:03:46,379 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:03:46,379 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:03:46,380 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:03:46,380 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:03:46,380 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:03:46,380 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-06-22 03:03:46,380 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:03:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:46,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:46,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:46,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:46,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:46,416 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 03:03:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:46,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:46,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:46,849 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 19 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true [2020-06-22 03:03:47,299 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:03:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:47,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:47,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:47,746 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 03:03:47,747 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 5 loop predicates [2020-06-22 03:03:47,747 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 161 states and 289 transitions. cyclomatic complexity: 137 Second operand 3 states. [2020-06-22 03:03:47,819 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 161 states and 289 transitions. cyclomatic complexity: 137. Second operand 3 states. Result 485 states and 864 transitions. Complement of second has 12 states. [2020-06-22 03:03:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 03:03:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:03:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-06-22 03:03:47,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 03:03:47,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:47,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 03:03:47,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:47,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 03:03:47,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:47,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 864 transitions. [2020-06-22 03:03:47,830 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 122 [2020-06-22 03:03:47,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 196 states and 336 transitions. [2020-06-22 03:03:47,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2020-06-22 03:03:47,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2020-06-22 03:03:47,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 336 transitions. [2020-06-22 03:03:47,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:47,833 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 336 transitions. [2020-06-22 03:03:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 336 transitions. [2020-06-22 03:03:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 145. [2020-06-22 03:03:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-06-22 03:03:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 263 transitions. [2020-06-22 03:03:47,841 INFO L729 BuchiCegarLoop]: Abstraction has 145 states and 263 transitions. [2020-06-22 03:03:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:03:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:03:47,842 INFO L87 Difference]: Start difference. First operand 145 states and 263 transitions. Second operand 3 states. [2020-06-22 03:03:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:47,867 INFO L93 Difference]: Finished difference Result 111 states and 197 transitions. [2020-06-22 03:03:47,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:03:47,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 197 transitions. [2020-06-22 03:03:47,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 86 [2020-06-22 03:03:47,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 108 states and 194 transitions. [2020-06-22 03:03:47,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2020-06-22 03:03:47,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2020-06-22 03:03:47,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 194 transitions. [2020-06-22 03:03:47,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:47,873 INFO L706 BuchiCegarLoop]: Abstraction has 108 states and 194 transitions. [2020-06-22 03:03:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 194 transitions. [2020-06-22 03:03:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2020-06-22 03:03:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-06-22 03:03:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 170 transitions. [2020-06-22 03:03:47,877 INFO L729 BuchiCegarLoop]: Abstraction has 92 states and 170 transitions. [2020-06-22 03:03:47,877 INFO L609 BuchiCegarLoop]: Abstraction has 92 states and 170 transitions. [2020-06-22 03:03:47,877 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 03:03:47,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 170 transitions. [2020-06-22 03:03:47,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2020-06-22 03:03:47,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:47,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:47,879 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 03:03:47,879 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:03:47,879 INFO L794 eck$LassoCheckResult]: Stem: 2221#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2222#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2226#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2303#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2271#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2258#L18-1 [2020-06-22 03:03:47,880 INFO L796 eck$LassoCheckResult]: Loop: 2258#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2264#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2261#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2256#L15-1 [58] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (< 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2258#L18-1 [2020-06-22 03:03:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash 64986523, now seen corresponding path program 1 times [2020-06-22 03:03:47,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:47,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:47,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:47,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:47,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2198609, now seen corresponding path program 1 times [2020-06-22 03:03:47,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:47,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:47,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1453011733, now seen corresponding path program 1 times [2020-06-22 03:03:47,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:47,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:47,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:47,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:47,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:47,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:47,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:47,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:47,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:47,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 03:03:47,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 03:03:47,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-06-22 03:03:47,981 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:47,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:47,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:47,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:47,981 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:03:47,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:47,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:47,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:47,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 03:03:47,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:47,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:47,983 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 03:03:47,990 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 03:03:47,993 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 03:03:47,996 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 03:03:48,043 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:48,043 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 03:03:48,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:48,047 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 03:03:48,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:03:48,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:48,107 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:03:48,109 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:48,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:48,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:48,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:48,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:03:48,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:03:48,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:48,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:48,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 03:03:48,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:48,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:48,111 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 03:03:48,117 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 03:03:48,120 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 03:03:48,122 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 03:03:48,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:48,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:03:48,155 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 03:03:48,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:48,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:48,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:48,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:48,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:48,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:48,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:48,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:03:48,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:03:48,163 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:03:48,164 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:03:48,164 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:03:48,164 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:03:48,164 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 03:03:48,165 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:03:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:48,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:48,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:48,210 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 03:03:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:48,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:48,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:48,314 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 03:03:48,314 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 5 loop predicates [2020-06-22 03:03:48,314 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 92 states and 170 transitions. cyclomatic complexity: 82 Second operand 3 states. [2020-06-22 03:03:48,584 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 92 states and 170 transitions. cyclomatic complexity: 82. Second operand 3 states. Result 1973 states and 2985 transitions. Complement of second has 146 states. [2020-06-22 03:03:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states [2020-06-22 03:03:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:03:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2020-06-22 03:03:48,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 03:03:48,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:48,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 03:03:48,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:48,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 03:03:48,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:48,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1973 states and 2985 transitions. [2020-06-22 03:03:48,606 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 418 [2020-06-22 03:03:48,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1973 states to 520 states and 802 transitions. [2020-06-22 03:03:48,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2020-06-22 03:03:48,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2020-06-22 03:03:48,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 520 states and 802 transitions. [2020-06-22 03:03:48,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:48,612 INFO L706 BuchiCegarLoop]: Abstraction has 520 states and 802 transitions. [2020-06-22 03:03:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 802 transitions. [2020-06-22 03:03:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 89. [2020-06-22 03:03:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-06-22 03:03:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 154 transitions. [2020-06-22 03:03:48,618 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 154 transitions. [2020-06-22 03:03:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 03:03:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 03:03:48,618 INFO L87 Difference]: Start difference. First operand 89 states and 154 transitions. Second operand 5 states. [2020-06-22 03:03:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:48,672 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2020-06-22 03:03:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 03:03:48,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 116 transitions. [2020-06-22 03:03:48,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2020-06-22 03:03:48,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 71 states and 104 transitions. [2020-06-22 03:03:48,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 03:03:48,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-06-22 03:03:48,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 104 transitions. [2020-06-22 03:03:48,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:48,682 INFO L706 BuchiCegarLoop]: Abstraction has 71 states and 104 transitions. [2020-06-22 03:03:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 104 transitions. [2020-06-22 03:03:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2020-06-22 03:03:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 03:03:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2020-06-22 03:03:48,684 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 86 transitions. [2020-06-22 03:03:48,684 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 86 transitions. [2020-06-22 03:03:48,684 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 03:03:48,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 86 transitions. [2020-06-22 03:03:48,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2020-06-22 03:03:48,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:48,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:48,685 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:03:48,685 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 5, 5, 2, 2, 2] [2020-06-22 03:03:48,686 INFO L794 eck$LassoCheckResult]: Stem: 4714#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4715#L18-1 [2020-06-22 03:03:48,686 INFO L796 eck$LassoCheckResult]: Loop: 4715#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4717#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4710#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4711#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4761#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4760#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4756#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4755#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4753#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4752#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4750#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4747#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4744#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4746#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4745#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4731#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4743#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4742#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4740#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4739#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4738#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4737#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4741#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4726#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4728#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4734#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4729#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4732#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4715#L18-1 [2020-06-22 03:03:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2020-06-22 03:03:48,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:48,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:48,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1582217713, now seen corresponding path program 1 times [2020-06-22 03:03:48,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:48,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:48,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:48,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-06-22 03:03:48,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:03:48,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 03:03:48,719 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:48,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 03:03:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:03:48,720 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. cyclomatic complexity: 31 Second operand 4 states. [2020-06-22 03:03:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:48,759 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2020-06-22 03:03:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 03:03:48,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2020-06-22 03:03:48,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 03:03:48,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2020-06-22 03:03:48,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 03:03:48,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 03:03:48,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2020-06-22 03:03:48,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:48,763 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2020-06-22 03:03:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2020-06-22 03:03:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-06-22 03:03:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 03:03:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2020-06-22 03:03:48,764 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. [2020-06-22 03:03:48,764 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. [2020-06-22 03:03:48,764 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 03:03:48,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 39 transitions. [2020-06-22 03:03:48,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 03:03:48,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:48,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:48,765 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:48,765 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-06-22 03:03:48,765 INFO L794 eck$LassoCheckResult]: Stem: 4808#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4809#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4811#L12 [2020-06-22 03:03:48,766 INFO L796 eck$LassoCheckResult]: Loop: 4811#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4804#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4805#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4816#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4821#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4815#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4817#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4818#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4811#L12 [2020-06-22 03:03:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times [2020-06-22 03:03:48,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:48,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2135425347, now seen corresponding path program 1 times [2020-06-22 03:03:48,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:48,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:48,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:48,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 03:03:48,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:48,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 03:03:48,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 03:03:48,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2020-06-22 03:03:48,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 03:03:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:03:48,839 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-06-22 03:03:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:48,859 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-06-22 03:03:48,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:03:48,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-06-22 03:03:48,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 03:03:48,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 27 transitions. [2020-06-22 03:03:48,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 03:03:48,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 03:03:48,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-06-22 03:03:48,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:48,862 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 03:03:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-06-22 03:03:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 03:03:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 03:03:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-06-22 03:03:48,864 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 03:03:48,864 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 03:03:48,864 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 03:03:48,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-06-22 03:03:48,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 03:03:48,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:48,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:48,865 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:48,865 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 03:03:48,865 INFO L794 eck$LassoCheckResult]: Stem: 4885#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4886#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4890#L12 [2020-06-22 03:03:48,865 INFO L796 eck$LassoCheckResult]: Loop: 4890#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4892#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4900#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4887#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4888#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4881#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4882#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4893#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4899#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4896#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4884#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4889#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4890#L12 [2020-06-22 03:03:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 2 times [2020-06-22 03:03:48,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:48,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:48,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:48,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1049578247, now seen corresponding path program 1 times [2020-06-22 03:03:48,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:48,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:48,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:48,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:48,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:48,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:48,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 03:03:48,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 03:03:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 03:03:48,953 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 03:03:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:48,999 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-06-22 03:03:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 03:03:49,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-06-22 03:03:49,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 03:03:49,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 36 transitions. [2020-06-22 03:03:49,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 03:03:49,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 03:03:49,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2020-06-22 03:03:49,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:49,002 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-06-22 03:03:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2020-06-22 03:03:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-06-22 03:03:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 03:03:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-06-22 03:03:49,004 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 03:03:49,004 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 03:03:49,004 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 03:03:49,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2020-06-22 03:03:49,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 03:03:49,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:49,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:49,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:49,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] [2020-06-22 03:03:49,005 INFO L794 eck$LassoCheckResult]: Stem: 4975#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4976#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4980#L12 [2020-06-22 03:03:49,006 INFO L796 eck$LassoCheckResult]: Loop: 4980#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4982#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4994#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4993#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4992#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4991#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4985#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4977#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4978#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4971#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4972#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4990#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4983#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4984#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4974#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4979#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4980#L12 [2020-06-22 03:03:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 3 times [2020-06-22 03:03:49,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:49,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1913650331, now seen corresponding path program 2 times [2020-06-22 03:03:49,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:49,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:49,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 03:03:49,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 03:03:49,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:03:49,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:03:49,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:49,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 03:03:49,114 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:49,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 03:03:49,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 03:03:49,114 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-22 03:03:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:49,167 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-06-22 03:03:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 03:03:49,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-06-22 03:03:49,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 03:03:49,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 41 transitions. [2020-06-22 03:03:49,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 03:03:49,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 03:03:49,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2020-06-22 03:03:49,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:49,170 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-06-22 03:03:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2020-06-22 03:03:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-06-22 03:03:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 03:03:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2020-06-22 03:03:49,172 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-06-22 03:03:49,172 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-06-22 03:03:49,172 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 03:03:49,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2020-06-22 03:03:49,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 03:03:49,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:49,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:49,173 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:49,173 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2020-06-22 03:03:49,174 INFO L794 eck$LassoCheckResult]: Stem: 5086#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5087#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5091#L12 [2020-06-22 03:03:49,174 INFO L796 eck$LassoCheckResult]: Loop: 5091#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5082#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5083#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5088#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5089#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5109#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5108#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5107#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5106#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5105#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5104#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5103#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5100#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5102#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5101#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5099#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5093#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5094#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5085#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5090#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5091#L12 [2020-06-22 03:03:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 4 times [2020-06-22 03:03:49,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1398889667, now seen corresponding path program 3 times [2020-06-22 03:03:49,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:49,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:49,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 03:03:49,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-06-22 03:03:49,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:03:49,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:49,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:49,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 03:03:49,312 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 03:03:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 03:03:49,313 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-06-22 03:03:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:49,372 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2020-06-22 03:03:49,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 03:03:49,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2020-06-22 03:03:49,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-06-22 03:03:49,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 46 transitions. [2020-06-22 03:03:49,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 03:03:49,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 03:03:49,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2020-06-22 03:03:49,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:49,375 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-06-22 03:03:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2020-06-22 03:03:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-06-22 03:03:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 03:03:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-06-22 03:03:49,377 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-06-22 03:03:49,377 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-06-22 03:03:49,377 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 03:03:49,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-06-22 03:03:49,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-22 03:03:49,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:49,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:49,378 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:49,378 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1] [2020-06-22 03:03:49,379 INFO L794 eck$LassoCheckResult]: Stem: 5218#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5219#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5223#L12 [2020-06-22 03:03:49,379 INFO L796 eck$LassoCheckResult]: Loop: 5223#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5214#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5215#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5220#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5221#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5245#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5244#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5243#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5242#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5241#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5240#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5239#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5238#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5237#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5236#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5235#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5232#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5234#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5233#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5231#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5225#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5226#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5217#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5222#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5223#L12 [2020-06-22 03:03:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 5 times [2020-06-22 03:03:49,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash -475343071, now seen corresponding path program 4 times [2020-06-22 03:03:49,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:49,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 03:03:49,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 03:03:49,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:03:49,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:03:49,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:49,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 03:03:49,500 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 03:03:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 03:03:49,500 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-06-22 03:03:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:49,565 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-06-22 03:03:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 03:03:49,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2020-06-22 03:03:49,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-06-22 03:03:49,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 51 transitions. [2020-06-22 03:03:49,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-06-22 03:03:49,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 03:03:49,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2020-06-22 03:03:49,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:49,568 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-06-22 03:03:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2020-06-22 03:03:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-06-22 03:03:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 03:03:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-06-22 03:03:49,570 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-06-22 03:03:49,570 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-06-22 03:03:49,570 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 03:03:49,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-06-22 03:03:49,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-06-22 03:03:49,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:49,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:49,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:49,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 6, 1, 1, 1] [2020-06-22 03:03:49,572 INFO L794 eck$LassoCheckResult]: Stem: 5371#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5372#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5376#L12 [2020-06-22 03:03:49,572 INFO L796 eck$LassoCheckResult]: Loop: 5376#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5367#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5368#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5373#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5374#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5402#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5401#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5400#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5399#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5398#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5397#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5396#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5395#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5394#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5393#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5392#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5391#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5390#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5389#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5388#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5385#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5387#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5386#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5384#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5378#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5379#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5370#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5375#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5376#L12 [2020-06-22 03:03:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 6 times [2020-06-22 03:03:49,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash -472649089, now seen corresponding path program 5 times [2020-06-22 03:03:49,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:49,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:49,659 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 03:03:49,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-06-22 03:03:49,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:03:49,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:03:49,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:49,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 03:03:49,709 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 03:03:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 03:03:49,709 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 13 Second operand 9 states. [2020-06-22 03:03:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:49,771 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-06-22 03:03:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 03:03:49,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-06-22 03:03:49,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 03:03:49,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2020-06-22 03:03:49,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-06-22 03:03:49,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-06-22 03:03:49,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2020-06-22 03:03:49,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:49,774 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2020-06-22 03:03:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2020-06-22 03:03:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-06-22 03:03:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 03:03:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2020-06-22 03:03:49,776 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-06-22 03:03:49,776 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-06-22 03:03:49,776 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 03:03:49,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2020-06-22 03:03:49,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-06-22 03:03:49,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:49,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:49,777 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:49,777 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 7, 1, 1, 1] [2020-06-22 03:03:49,778 INFO L794 eck$LassoCheckResult]: Stem: 5545#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5546#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5550#L12 [2020-06-22 03:03:49,778 INFO L796 eck$LassoCheckResult]: Loop: 5550#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5541#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5542#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5547#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5548#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5580#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5579#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5578#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5577#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5576#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5575#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5574#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5573#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5572#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5571#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5570#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5569#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5568#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5567#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5566#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5565#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5564#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5563#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5562#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5559#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5561#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5560#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5558#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5552#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5553#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5544#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5549#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5550#L12 [2020-06-22 03:03:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 7 times [2020-06-22 03:03:49,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash 690237149, now seen corresponding path program 6 times [2020-06-22 03:03:49,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:49,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:49,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 03:03:49,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-06-22 03:03:49,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:03:49,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:03:49,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:49,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:49,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 03:03:49,917 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 03:03:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 03:03:49,918 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-06-22 03:03:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:49,999 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2020-06-22 03:03:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 03:03:50,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2020-06-22 03:03:50,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-06-22 03:03:50,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 61 transitions. [2020-06-22 03:03:50,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-06-22 03:03:50,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-06-22 03:03:50,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 61 transitions. [2020-06-22 03:03:50,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:50,002 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-06-22 03:03:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 61 transitions. [2020-06-22 03:03:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-06-22 03:03:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 03:03:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2020-06-22 03:03:50,003 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2020-06-22 03:03:50,004 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2020-06-22 03:03:50,004 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 03:03:50,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 57 transitions. [2020-06-22 03:03:50,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-06-22 03:03:50,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:50,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:50,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:50,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 1, 1, 1] [2020-06-22 03:03:50,005 INFO L794 eck$LassoCheckResult]: Stem: 5740#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5741#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5745#L12 [2020-06-22 03:03:50,006 INFO L796 eck$LassoCheckResult]: Loop: 5745#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5736#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5737#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5742#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5743#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5779#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5778#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5777#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5776#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5775#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5774#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5773#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5772#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5771#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5770#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5769#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5768#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5767#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5766#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5765#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5764#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5763#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5762#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5761#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5760#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5759#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5758#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5757#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5754#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5756#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5755#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5753#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5747#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5748#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5739#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5744#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5745#L12 [2020-06-22 03:03:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:50,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 8 times [2020-06-22 03:03:50,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:50,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:50,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:50,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1725756357, now seen corresponding path program 7 times [2020-06-22 03:03:50,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:50,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:50,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:03:50,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-06-22 03:03:50,157 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:03:50,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 03:03:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 03:03:50,158 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. cyclomatic complexity: 15 Second operand 11 states. [2020-06-22 03:03:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:03:50,250 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2020-06-22 03:03:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 03:03:50,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 113 transitions. [2020-06-22 03:03:50,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2020-06-22 03:03:50,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 88 states and 110 transitions. [2020-06-22 03:03:50,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-06-22 03:03:50,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 03:03:50,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 110 transitions. [2020-06-22 03:03:50,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:50,254 INFO L706 BuchiCegarLoop]: Abstraction has 88 states and 110 transitions. [2020-06-22 03:03:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 110 transitions. [2020-06-22 03:03:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2020-06-22 03:03:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-06-22 03:03:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2020-06-22 03:03:50,256 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2020-06-22 03:03:50,257 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2020-06-22 03:03:50,257 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 03:03:50,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 99 transitions. [2020-06-22 03:03:50,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2020-06-22 03:03:50,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:50,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:50,258 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:03:50,258 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] [2020-06-22 03:03:50,258 INFO L794 eck$LassoCheckResult]: Stem: 5995#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5996#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5998#L12 [2020-06-22 03:03:50,259 INFO L796 eck$LassoCheckResult]: Loop: 5998#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 6009#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6039#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6038#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6037#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6036#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6035#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6034#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6033#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6032#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6031#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6030#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6029#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6028#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6027#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6026#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6025#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6024#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6023#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6022#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6021#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6020#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6019#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6018#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6017#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6016#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6015#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6014#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6013#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6012#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6011#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6010#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6006#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6008#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6007#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6005#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6004#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6003#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5993#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6067#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5998#L12 [2020-06-22 03:03:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 9 times [2020-06-22 03:03:50,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash 160959129, now seen corresponding path program 8 times [2020-06-22 03:03:50,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:50,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:50,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:50,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash 15078428, now seen corresponding path program 1 times [2020-06-22 03:03:50,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:50,450 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2020-06-22 03:03:50,458 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:50,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:50,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:50,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:50,458 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:03:50,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:50,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:50,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:50,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop [2020-06-22 03:03:50,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:50,459 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:50,460 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 03:03:50,466 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 03:03:50,468 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 03:03:50,471 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 03:03:50,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:50,521 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:50,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:50,524 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:50,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:03:50,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:50,586 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:03:50,588 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:50,588 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:50,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:50,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:50,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:03:50,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:03:50,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:50,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:50,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop [2020-06-22 03:03:50,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:50,589 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:50,590 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 03:03:50,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 03:03:50,599 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 03:03:50,602 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 03:03:50,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:50,652 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:03:50,652 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 03:03:50,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:50,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:50,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:50,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:50,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:50,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:50,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:50,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:03:50,658 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:03:50,658 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:03:50,658 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:03:50,658 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:03:50,659 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:03:50,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2020-06-22 03:03:50,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:03:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:03:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:50,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:50,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,474 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 03:03:51,474 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 8 loop predicates [2020-06-22 03:03:51,474 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 78 states and 99 transitions. cyclomatic complexity: 23 Second operand 5 states. [2020-06-22 03:03:51,670 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 78 states and 99 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 1099 states and 1322 transitions. Complement of second has 229 states. [2020-06-22 03:03:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2020-06-22 03:03:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:03:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2020-06-22 03:03:51,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 66 transitions. Stem has 2 letters. Loop has 40 letters. [2020-06-22 03:03:51,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:51,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 66 transitions. Stem has 42 letters. Loop has 40 letters. [2020-06-22 03:03:51,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:51,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 66 transitions. Stem has 2 letters. Loop has 80 letters. [2020-06-22 03:03:51,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:03:51,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1099 states and 1322 transitions. [2020-06-22 03:03:51,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 142 [2020-06-22 03:03:51,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1099 states to 258 states and 301 transitions. [2020-06-22 03:03:51,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-06-22 03:03:51,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2020-06-22 03:03:51,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 301 transitions. [2020-06-22 03:03:51,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:03:51,688 INFO L706 BuchiCegarLoop]: Abstraction has 258 states and 301 transitions. [2020-06-22 03:03:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 301 transitions. [2020-06-22 03:03:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 85. [2020-06-22 03:03:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-06-22 03:03:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2020-06-22 03:03:51,691 INFO L729 BuchiCegarLoop]: Abstraction has 85 states and 99 transitions. [2020-06-22 03:03:51,691 INFO L609 BuchiCegarLoop]: Abstraction has 85 states and 99 transitions. [2020-06-22 03:03:51,691 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2020-06-22 03:03:51,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 99 transitions. [2020-06-22 03:03:51,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:03:51,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:03:51,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:03:51,693 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:03:51,693 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2020-06-22 03:03:51,693 INFO L794 eck$LassoCheckResult]: Stem: 12010#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 12011#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12022#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12027#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 12024#L15-1 [2020-06-22 03:03:51,694 INFO L796 eck$LassoCheckResult]: Loop: 12024#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12025#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12089#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12017#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12090#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12018#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 12019#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12065#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12064#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12063#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12006#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12007#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12026#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12062#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12059#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12058#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12057#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12056#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12055#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12054#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12053#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12052#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12051#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12050#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12049#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12048#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12047#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12046#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12045#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12044#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12043#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12042#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12041#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12040#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12039#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12038#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12037#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12034#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12036#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12035#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12033#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12032#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12030#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 12024#L15-1 [2020-06-22 03:03:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 2 times [2020-06-22 03:03:51,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:51,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:51,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:03:51,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:51,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1231542293, now seen corresponding path program 9 times [2020-06-22 03:03:51,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:51,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:51,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:03:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1576558748, now seen corresponding path program 2 times [2020-06-22 03:03:51,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:03:51,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:03:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:51,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:03:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:03:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:03:51,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:03:51,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:03:51,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 03:03:51,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 03:03:51,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:03:51,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:51,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:03:51,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:03:51,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 03:03:52,009 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-06-22 03:03:52,019 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:52,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:52,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:52,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:52,019 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:03:52,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:52,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:52,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:52,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-06-22 03:03:52,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:52,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:52,021 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 03:03:52,023 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 03:03:52,025 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 03:03:52,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 03:03:52,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:52,073 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:52,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:52,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:52,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:52,108 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:52,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:52,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:52,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:52,142 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:52,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:52,147 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:52,150 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:03:52,150 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:52,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:03:52,179 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:03:52,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:03:52,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:03:52,214 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:03:52,239 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:03:52,240 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:03:52,240 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:03:52,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:03:52,240 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:03:52,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:03:52,240 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:03:52,240 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:03:52,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-06-22 03:03:52,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:03:52,241 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:03:52,242 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 03:03:52,252 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 03:03:52,257 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 03:03:52,260 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 03:03:52,299 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:03:52,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:03:52,300 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 03:03:52,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:52,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:52,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:52,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:52,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:03:52,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:03:52,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:52,304 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 03:03:52,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:52,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:52,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:52,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:52,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:52,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:52,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:52,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:52,307 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 03:03:52,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:52,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:52,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:52,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:52,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:03:52,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:03:52,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:03:52,311 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 03:03:52,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:03:52,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:03:52,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:03:52,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:03:52,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:03:52,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:03:52,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:03:52,314 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:03:52,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:03:52,316 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:03:52,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:03:52,316 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:03:52,316 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:03:52,316 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2020-06-22 03:03:52,316 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:03:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:03:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:03:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:52,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:52,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:53,392 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 13 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true [2020-06-22 03:03:54,300 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:03:55,625 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:03:57,387 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:03:57,816 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 Int)) (<= 13 (+ (* 2 v_prenex_3) c_oldRank0))) is different from true [2020-06-22 03:03:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:57,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:57,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:58,262 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_153 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_153) c_oldRank0))) is different from true [2020-06-22 03:03:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:58,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:58,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:59,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:59,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:03:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:03:59,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:03:59,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:00,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:00,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:00,613 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_162 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_162) c_oldRank0))) is different from true [2020-06-22 03:04:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:01,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:01,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:01,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:01,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:02,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:02,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:02,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:02,962 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_171 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_171)))) is different from true [2020-06-22 03:04:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:03,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:03,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:03,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:03,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:04,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:04,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:04,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:04,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:05,316 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_180 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_180) c_oldRank0))) is different from true [2020-06-22 03:04:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:05,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:05,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:06,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:06,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:06,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:06,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:07,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:07,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:07,652 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_189 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_189) c_oldRank0))) is different from true [2020-06-22 03:04:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:08,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:08,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:08,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:08,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:09,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:09,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:09,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:09,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:09,975 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_198 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_198) c_oldRank0))) is different from true [2020-06-22 03:04:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:10,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:10,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:10,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:10,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:11,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:11,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:11,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:11,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:12,292 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_207 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_207) c_oldRank0))) is different from true [2020-06-22 03:04:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:12,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:12,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:13,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:13,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:13,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:13,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:14,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:14,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:14,620 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_216 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_216)))) is different from true [2020-06-22 03:04:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:15,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:15,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:15,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:15,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:16,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:16,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:16,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:16,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:16,931 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_225 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_225)))) is different from true [2020-06-22 03:04:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:17,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:17,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:17,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:17,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:17,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:04:17,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:17,548 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 23 predicates after loop cannibalization [2020-06-22 03:04:17,549 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 23 loop predicates [2020-06-22 03:04:17,549 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 85 states and 99 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-06-22 03:04:17,715 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 85 states and 99 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 206 states and 231 transitions. Complement of second has 12 states. [2020-06-22 03:04:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 03:04:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:04:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-06-22 03:04:17,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 44 letters. [2020-06-22 03:04:17,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:17,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 48 letters. Loop has 44 letters. [2020-06-22 03:04:17,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:17,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 88 letters. [2020-06-22 03:04:17,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:17,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 231 transitions. [2020-06-22 03:04:17,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:04:17,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 92 states and 106 transitions. [2020-06-22 03:04:17,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-06-22 03:04:17,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2020-06-22 03:04:17,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 106 transitions. [2020-06-22 03:04:17,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:17,724 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 106 transitions. [2020-06-22 03:04:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 106 transitions. [2020-06-22 03:04:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-06-22 03:04:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-06-22 03:04:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2020-06-22 03:04:17,726 INFO L729 BuchiCegarLoop]: Abstraction has 85 states and 98 transitions. [2020-06-22 03:04:17,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 03:04:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 03:04:17,727 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 5 states. [2020-06-22 03:04:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:04:17,761 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2020-06-22 03:04:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 03:04:17,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 114 transitions. [2020-06-22 03:04:17,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:04:17,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 94 states and 110 transitions. [2020-06-22 03:04:17,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2020-06-22 03:04:17,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2020-06-22 03:04:17,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 110 transitions. [2020-06-22 03:04:17,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:17,764 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2020-06-22 03:04:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 110 transitions. [2020-06-22 03:04:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2020-06-22 03:04:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-06-22 03:04:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2020-06-22 03:04:17,767 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 99 transitions. [2020-06-22 03:04:17,767 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 99 transitions. [2020-06-22 03:04:17,767 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2020-06-22 03:04:17,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 99 transitions. [2020-06-22 03:04:17,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:04:17,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:04:17,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:04:17,768 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:04:17,768 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2020-06-22 03:04:17,768 INFO L794 eck$LassoCheckResult]: Stem: 18249#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 18250#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18263#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18256#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 18270#L15-1 [2020-06-22 03:04:17,769 INFO L796 eck$LassoCheckResult]: Loop: 18270#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18251#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18252#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18245#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18246#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18272#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18273#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18247#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18248#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18253#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18254#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 18267#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18307#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18306#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18305#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18303#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18257#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18258#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18304#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18302#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18301#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18300#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18299#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18298#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18297#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18296#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18295#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18294#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18293#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18292#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18291#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18290#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18289#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18288#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18287#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18286#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18285#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18284#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18283#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18282#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18281#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18280#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18277#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18279#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18278#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18276#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18275#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18274#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 18270#L15-1 [2020-06-22 03:04:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 3 times [2020-06-22 03:04:17,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:17,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:17,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:17,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1131309507, now seen corresponding path program 10 times [2020-06-22 03:04:17,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:17,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:17,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -757854610, now seen corresponding path program 3 times [2020-06-22 03:04:17,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:17,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:17,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:17,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:17,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 137 proven. 10 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:17,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:04:17,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:04:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 03:04:17,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-06-22 03:04:17,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:04:17,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 03:04:17,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 270 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 03:04:17,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:04:17,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 12 [2020-06-22 03:04:18,072 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2020-06-22 03:04:18,079 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:18,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:18,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:18,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:18,080 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:04:18,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:18,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:18,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:18,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-06-22 03:04:18,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:18,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:18,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 03:04:18,084 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 03:04:18,087 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 03:04:18,091 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 03:04:18,128 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:18,129 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:18,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:18,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:18,157 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:18,158 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:18,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:18,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:18,188 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:18,188 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:18,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:18,192 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:18,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:04:18,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:18,226 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:04:18,249 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:18,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:18,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:18,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:18,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:04:18,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:04:18,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:18,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:18,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-06-22 03:04:18,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:18,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:18,251 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 03:04:18,254 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 03:04:18,256 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 03:04:18,261 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 03:04:18,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:18,302 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:04:18,302 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 03:04:18,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:18,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:18,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:18,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:18,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:04:18,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:04:18,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:04:18,307 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 03:04:18,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:18,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:18,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:18,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:18,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:04:18,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:04:18,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:04:18,310 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 03:04:18,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:18,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:04:18,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:18,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:18,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:18,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:04:18,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:04:18,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:04:18,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:04:18,315 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:04:18,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:04:18,316 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:04:18,316 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:04:18,316 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2020-06-22 03:04:18,316 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:04:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:18,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:18,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,444 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 03:04:19,445 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 14 loop predicates [2020-06-22 03:04:19,445 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 99 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-06-22 03:04:19,648 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 99 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 597 states and 655 transitions. Complement of second has 48 states. [2020-06-22 03:04:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 03:04:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 03:04:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2020-06-22 03:04:19,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 4 letters. Loop has 48 letters. [2020-06-22 03:04:19,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:19,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 52 letters. Loop has 48 letters. [2020-06-22 03:04:19,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:19,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 4 letters. Loop has 96 letters. [2020-06-22 03:04:19,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:19,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 655 transitions. [2020-06-22 03:04:19,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 [2020-06-22 03:04:19,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 175 states and 197 transitions. [2020-06-22 03:04:19,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2020-06-22 03:04:19,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2020-06-22 03:04:19,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 197 transitions. [2020-06-22 03:04:19,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:19,659 INFO L706 BuchiCegarLoop]: Abstraction has 175 states and 197 transitions. [2020-06-22 03:04:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 197 transitions. [2020-06-22 03:04:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 89. [2020-06-22 03:04:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-06-22 03:04:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2020-06-22 03:04:19,661 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 102 transitions. [2020-06-22 03:04:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 03:04:19,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-06-22 03:04:19,662 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 12 states. [2020-06-22 03:04:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:04:19,741 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-06-22 03:04:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 03:04:19,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 113 transitions. [2020-06-22 03:04:19,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:04:19,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 113 transitions. [2020-06-22 03:04:19,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2020-06-22 03:04:19,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-06-22 03:04:19,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 113 transitions. [2020-06-22 03:04:19,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:19,744 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 113 transitions. [2020-06-22 03:04:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 113 transitions. [2020-06-22 03:04:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2020-06-22 03:04:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-06-22 03:04:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2020-06-22 03:04:19,746 INFO L729 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2020-06-22 03:04:19,747 INFO L609 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2020-06-22 03:04:19,747 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2020-06-22 03:04:19,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2020-06-22 03:04:19,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:04:19,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:04:19,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:04:19,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:04:19,748 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2020-06-22 03:04:19,748 INFO L794 eck$LassoCheckResult]: Stem: 26019#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 26020#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26033#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26034#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26042#L15-1 [2020-06-22 03:04:19,749 INFO L796 eck$LassoCheckResult]: Loop: 26042#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26060#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26058#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26056#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26054#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26052#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26050#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26048#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26046#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26044#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26045#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26017#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26018#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26031#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26040#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26039#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26027#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26028#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26102#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26101#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26100#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26022#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26015#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26016#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26026#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26099#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26098#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26097#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26096#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26095#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26094#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26093#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26092#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26091#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26090#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26089#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26088#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26087#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26086#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26085#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26083#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26081#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26079#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26077#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26075#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26068#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26072#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26070#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26067#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26065#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26063#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26042#L15-1 [2020-06-22 03:04:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 4 times [2020-06-22 03:04:19,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:19,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:19,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:19,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:19,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 816286607, now seen corresponding path program 11 times [2020-06-22 03:04:19,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:19,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:19,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash -207584448, now seen corresponding path program 4 times [2020-06-22 03:04:19,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:19,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:19,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 177 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:19,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:04:19,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:04:19,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 03:04:19,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 03:04:19,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:04:19,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:19,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 177 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:04:19,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 03:04:20,033 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2020-06-22 03:04:20,041 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:20,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:20,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:20,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:20,041 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:04:20,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:20,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:20,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:20,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop [2020-06-22 03:04:20,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:20,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:20,042 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 03:04:20,045 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 03:04:20,047 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 03:04:20,051 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 03:04:20,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:20,091 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:20,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:20,095 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:20,123 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:20,123 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:20,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:20,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:20,153 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:20,153 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:20,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:20,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:20,160 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:20,160 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:20,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:20,186 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:20,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:04:20,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:20,218 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:04:20,241 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:20,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:20,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:20,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:20,242 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:04:20,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:04:20,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:20,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:20,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop [2020-06-22 03:04:20,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:20,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:20,243 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 03:04:20,245 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 03:04:20,249 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 03:04:20,253 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 03:04:20,290 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:20,290 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:04:20,291 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 03:04:20,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:20,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:20,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:20,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:20,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:04:20,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:04:20,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:04:20,295 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 03:04:20,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:20,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:04:20,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:20,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:20,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:20,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:04:20,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:04:20,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:04:20,297 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 03:04:20,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:20,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:04:20,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:20,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:20,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:20,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:04:20,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:04:20,299 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:04:20,301 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:04:20,301 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:04:20,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:04:20,301 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:04:20,301 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:04:20,301 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2020-06-22 03:04:20,302 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:04:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:20,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:20,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:21,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:21,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:21,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:21,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:21,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:21,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:21,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:21,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:21,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:21,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:22,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:22,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:22,564 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 15 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true [2020-06-22 03:04:23,461 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:04:24,774 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:04:26,519 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:04:28,725 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:04:31,358 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:04:31,789 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_30 Int)) (<= 15 (+ (* 2 v_prenex_30) c_oldRank0))) is different from true [2020-06-22 03:04:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:31,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:31,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:32,234 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_482 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_482) c_oldRank0))) is different from true [2020-06-22 03:04:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:32,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:33,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:33,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:33,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:33,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:34,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:34,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:34,571 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_499 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_499) c_oldRank0))) is different from true [2020-06-22 03:04:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:35,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:35,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:35,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:35,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:36,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:36,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:36,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:36,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:36,910 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_516 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_516) c_oldRank0))) is different from true [2020-06-22 03:04:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:37,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:37,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:37,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:38,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:38,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:38,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:38,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:39,307 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_533 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_533)))) is different from true [2020-06-22 03:04:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:39,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:39,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:40,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:40,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:40,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:40,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:41,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:41,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:41,638 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_550 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_550) c_oldRank0))) is different from true [2020-06-22 03:04:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:42,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:42,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:42,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:42,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:43,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:43,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:43,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:43,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:43,969 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_567 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_567)))) is different from true [2020-06-22 03:04:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:44,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:44,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:44,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:44,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:45,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:45,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:45,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:45,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:46,302 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_584 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_584) c_oldRank0))) is different from true [2020-06-22 03:04:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:46,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:46,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:47,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:47,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:47,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:47,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:48,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:48,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:48,645 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_601 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_601)))) is different from true [2020-06-22 03:04:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:49,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:49,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:49,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:49,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:50,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:50,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:50,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:50,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:50,976 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_618 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_618) c_oldRank0))) is different from true [2020-06-22 03:04:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:51,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:51,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:51,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:51,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:51,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:04:51,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:51,705 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 31 predicates after loop cannibalization [2020-06-22 03:04:51,705 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 31 loop predicates [2020-06-22 03:04:51,705 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 90 states and 104 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-06-22 03:04:52,040 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 90 states and 104 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 232 states and 256 transitions. Complement of second has 20 states. [2020-06-22 03:04:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 03:04:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 03:04:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2020-06-22 03:04:52,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 4 letters. Loop has 52 letters. [2020-06-22 03:04:52,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:52,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 56 letters. Loop has 52 letters. [2020-06-22 03:04:52,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:52,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 4 letters. Loop has 104 letters. [2020-06-22 03:04:52,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:52,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 256 transitions. [2020-06-22 03:04:52,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:04:52,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 102 states and 117 transitions. [2020-06-22 03:04:52,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2020-06-22 03:04:52,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2020-06-22 03:04:52,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 117 transitions. [2020-06-22 03:04:52,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:52,047 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 117 transitions. [2020-06-22 03:04:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 117 transitions. [2020-06-22 03:04:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2020-06-22 03:04:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-06-22 03:04:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2020-06-22 03:04:52,049 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 108 transitions. [2020-06-22 03:04:52,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 03:04:52,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 03:04:52,049 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 7 states. [2020-06-22 03:04:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:04:52,099 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2020-06-22 03:04:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 03:04:52,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 117 transitions. [2020-06-22 03:04:52,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:04:52,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 117 transitions. [2020-06-22 03:04:52,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2020-06-22 03:04:52,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2020-06-22 03:04:52,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 117 transitions. [2020-06-22 03:04:52,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:52,102 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 117 transitions. [2020-06-22 03:04:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 117 transitions. [2020-06-22 03:04:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2020-06-22 03:04:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-06-22 03:04:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2020-06-22 03:04:52,104 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 108 transitions. [2020-06-22 03:04:52,104 INFO L609 BuchiCegarLoop]: Abstraction has 94 states and 108 transitions. [2020-06-22 03:04:52,104 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2020-06-22 03:04:52,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 108 transitions. [2020-06-22 03:04:52,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:04:52,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:04:52,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:04:52,106 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:04:52,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] [2020-06-22 03:04:52,106 INFO L794 eck$LassoCheckResult]: Stem: 34613#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 34614#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34627#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34628#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 34636#L15-1 [2020-06-22 03:04:52,107 INFO L796 eck$LassoCheckResult]: Loop: 34636#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34662#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34660#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34658#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34656#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34654#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34652#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34650#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34648#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34646#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34644#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34641#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34640#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34638#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34639#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34611#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34612#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34625#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34634#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 34633#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34621#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34622#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34697#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34696#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34695#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34615#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34616#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34609#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34610#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34620#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34693#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34692#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34691#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34690#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34689#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34688#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34687#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34686#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34685#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34684#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34683#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34682#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34681#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34680#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34679#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34678#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34677#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34676#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34675#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34674#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34670#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34673#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34672#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34669#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34667#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34665#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 34636#L15-1 [2020-06-22 03:04:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 5 times [2020-06-22 03:04:52,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:52,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 322865121, now seen corresponding path program 12 times [2020-06-22 03:04:52,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:52,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1017265938, now seen corresponding path program 5 times [2020-06-22 03:04:52,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:52,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:52,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:52,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:52,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:52,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:04:52,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:04:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 03:04:52,202 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-06-22 03:04:52,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:04:52,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:52,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:04:52,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 03:04:52,419 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-06-22 03:04:52,426 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:52,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:52,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:52,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:52,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:04:52,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:52,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:52,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:52,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop [2020-06-22 03:04:52,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:52,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:52,427 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 03:04:52,432 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 03:04:52,434 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 03:04:52,438 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 03:04:52,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:52,473 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:52,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:52,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:52,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:52,479 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:52,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:52,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:52,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:04:52,531 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:52,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:52,534 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:52,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:04:52,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:52,568 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:04:52,591 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:52,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:52,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:52,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:52,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:04:52,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:04:52,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:52,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:52,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop [2020-06-22 03:04:52,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:52,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:52,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 03:04:52,598 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 03:04:52,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 03:04:52,604 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 03:04:52,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:52,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:04:52,644 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 03:04:52,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:52,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:04:52,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:52,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:52,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:52,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:04:52,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:04:52,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:04:52,646 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 03:04:52,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:52,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:52,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:52,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:52,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:04:52,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:04:52,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:04:52,650 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 03:04:52,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:52,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:04:52,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:52,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:52,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:52,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:04:52,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:04:52,653 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:04:52,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:04:52,654 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:04:52,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:04:52,654 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:04:52,654 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:04:52,655 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2020-06-22 03:04:52,655 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:04:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:52,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:52,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:53,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:53,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,247 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 20 predicates after loop cannibalization [2020-06-22 03:04:54,248 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 20 loop predicates [2020-06-22 03:04:54,248 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 94 states and 108 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 03:04:54,587 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 94 states and 108 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 662 states and 713 transitions. Complement of second has 72 states. [2020-06-22 03:04:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-06-22 03:04:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 03:04:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2020-06-22 03:04:54,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 4 letters. Loop has 56 letters. [2020-06-22 03:04:54,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:54,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 60 letters. Loop has 56 letters. [2020-06-22 03:04:54,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:54,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 4 letters. Loop has 112 letters. [2020-06-22 03:04:54,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:04:54,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 713 transitions. [2020-06-22 03:04:54,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 [2020-06-22 03:04:54,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 184 states and 205 transitions. [2020-06-22 03:04:54,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-06-22 03:04:54,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2020-06-22 03:04:54,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 205 transitions. [2020-06-22 03:04:54,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:54,596 INFO L706 BuchiCegarLoop]: Abstraction has 184 states and 205 transitions. [2020-06-22 03:04:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 205 transitions. [2020-06-22 03:04:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 98. [2020-06-22 03:04:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-06-22 03:04:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-06-22 03:04:54,599 INFO L729 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-06-22 03:04:54,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 03:04:54,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 03:04:54,599 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2020-06-22 03:04:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:04:54,667 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2020-06-22 03:04:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 03:04:54,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 121 transitions. [2020-06-22 03:04:54,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:04:54,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 121 transitions. [2020-06-22 03:04:54,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-06-22 03:04:54,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-06-22 03:04:54,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 121 transitions. [2020-06-22 03:04:54,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:04:54,670 INFO L706 BuchiCegarLoop]: Abstraction has 106 states and 121 transitions. [2020-06-22 03:04:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 121 transitions. [2020-06-22 03:04:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2020-06-22 03:04:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-06-22 03:04:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-06-22 03:04:54,673 INFO L729 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-06-22 03:04:54,673 INFO L609 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-06-22 03:04:54,673 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2020-06-22 03:04:54,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 112 transitions. [2020-06-22 03:04:54,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:04:54,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:04:54,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:04:54,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:04:54,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2020-06-22 03:04:54,675 INFO L794 eck$LassoCheckResult]: Stem: 44988#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 44989#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45002#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45003#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 45011#L15-1 [2020-06-22 03:04:54,675 INFO L796 eck$LassoCheckResult]: Loop: 45011#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45042#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45041#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45040#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45039#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45037#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45035#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45033#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45031#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45029#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45027#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45025#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45023#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45018#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45019#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45075#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45074#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45073#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 44986#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 44987#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45000#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45009#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 45008#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 44996#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44997#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45072#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45071#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45070#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44990#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 44991#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 44984#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 44985#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44995#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45068#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45067#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45066#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45065#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45064#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45063#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45062#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45061#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45060#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45059#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45058#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45057#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45056#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45055#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45054#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45053#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45052#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45051#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45050#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45049#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45046#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45048#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45047#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45045#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45044#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45043#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 45011#L15-1 [2020-06-22 03:04:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 6 times [2020-06-22 03:04:54,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:54,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1636103373, now seen corresponding path program 13 times [2020-06-22 03:04:54,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:54,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:54,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:04:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:04:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912932, now seen corresponding path program 6 times [2020-06-22 03:04:54,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:04:54,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:04:54,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:54,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:04:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:04:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 257 proven. 55 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:54,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:04:54,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:04:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 03:04:54,805 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2020-06-22 03:04:54,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:04:54,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:54,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 257 proven. 55 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:54,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:04:54,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 03:04:55,147 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-06-22 03:04:55,157 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:55,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:55,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:55,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:55,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:04:55,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:55,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:55,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:55,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop [2020-06-22 03:04:55,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:55,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:55,159 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 03:04:55,165 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 03:04:55,170 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 03:04:55,175 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 03:04:55,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:55,222 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:55,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:04:55,226 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:04:55,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:04:55,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:04:55,261 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:04:55,284 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:04:55,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:04:55,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:04:55,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:04:55,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:04:55,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:04:55,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:04:55,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:04:55,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop [2020-06-22 03:04:55,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:04:55,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:04:55,286 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 03:04:55,299 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 03:04:55,302 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 03:04:55,304 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 03:04:55,358 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:04:55,358 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:04:55,359 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 03:04:55,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:04:55,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:04:55,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:04:55,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:04:55,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:04:55,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:04:55,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:04:55,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:04:55,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:04:55,363 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:04:55,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:04:55,364 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:04:55,364 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:04:55,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2020-06-22 03:04:55,364 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:04:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:04:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:04:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:55,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:55,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:56,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:56,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:57,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:04:57,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:04:58,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:04:58,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:04:58,939 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 17 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true [2020-06-22 03:04:59,848 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:01,181 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:02,950 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:05,157 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:07,811 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:10,897 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:14,416 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:14,849 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_57 Int)) (<= 17 (+ (* 2 v_prenex_57) c_oldRank0))) is different from true [2020-06-22 03:05:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:14,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:14,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:15,299 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1090 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1090) c_oldRank0))) is different from true [2020-06-22 03:05:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:15,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:15,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:16,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:16,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:16,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:16,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:17,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:17,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:17,690 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1115 Int)) (<= 17 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1115)))) is different from true [2020-06-22 03:05:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:18,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:18,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:18,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:18,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:19,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:19,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:19,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:19,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:20,066 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1140 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1140) c_oldRank0))) is different from true [2020-06-22 03:05:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:20,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:20,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:21,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:21,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:21,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:21,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:22,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:22,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:22,451 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1165 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1165) c_oldRank0))) is different from true [2020-06-22 03:05:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:22,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:22,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:23,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:23,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:23,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:23,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:24,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:24,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:24,826 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1190 Int)) (<= 17 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1190)))) is different from true [2020-06-22 03:05:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:25,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:25,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:25,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:25,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:26,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:26,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:26,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:26,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:27,210 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1215 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1215) c_oldRank0))) is different from true [2020-06-22 03:05:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:27,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:27,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:28,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:28,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:28,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:28,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:29,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:29,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:29,584 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1240 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1240) c_oldRank0))) is different from true [2020-06-22 03:05:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:30,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:30,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:30,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:30,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:31,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:31,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:31,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:31,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:31,951 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1265 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1265) c_oldRank0))) is different from true [2020-06-22 03:05:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:32,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:32,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:32,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:32,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:33,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:33,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:33,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:33,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:34,339 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1290 Int)) (<= 17 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1290)))) is different from true [2020-06-22 03:05:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:34,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:34,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:35,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:35,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:35,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:05:35,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:35,214 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 39 predicates after loop cannibalization [2020-06-22 03:05:35,215 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 39 loop predicates [2020-06-22 03:05:35,215 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 98 states and 112 transitions. cyclomatic complexity: 16 Second operand 9 states. [2020-06-22 03:05:35,787 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 98 states and 112 transitions. cyclomatic complexity: 16. Second operand 9 states. Result 256 states and 278 transitions. Complement of second has 28 states. [2020-06-22 03:05:35,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-06-22 03:05:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 03:05:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-06-22 03:05:35,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 4 letters. Loop has 60 letters. [2020-06-22 03:05:35,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:05:35,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 64 letters. Loop has 60 letters. [2020-06-22 03:05:35,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:05:35,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 4 letters. Loop has 120 letters. [2020-06-22 03:05:35,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:05:35,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 278 transitions. [2020-06-22 03:05:35,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:05:35,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 110 states and 125 transitions. [2020-06-22 03:05:35,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-06-22 03:05:35,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2020-06-22 03:05:35,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 125 transitions. [2020-06-22 03:05:35,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:05:35,794 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 125 transitions. [2020-06-22 03:05:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 125 transitions. [2020-06-22 03:05:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2020-06-22 03:05:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-06-22 03:05:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2020-06-22 03:05:35,797 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 116 transitions. [2020-06-22 03:05:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 03:05:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 03:05:35,797 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 9 states. [2020-06-22 03:05:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:05:35,859 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2020-06-22 03:05:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 03:05:35,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 125 transitions. [2020-06-22 03:05:35,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:05:35,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 125 transitions. [2020-06-22 03:05:35,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2020-06-22 03:05:35,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2020-06-22 03:05:35,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 125 transitions. [2020-06-22 03:05:35,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:05:35,862 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 125 transitions. [2020-06-22 03:05:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 125 transitions. [2020-06-22 03:05:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2020-06-22 03:05:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-06-22 03:05:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2020-06-22 03:05:35,864 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 116 transitions. [2020-06-22 03:05:35,864 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 116 transitions. [2020-06-22 03:05:35,865 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2020-06-22 03:05:35,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 116 transitions. [2020-06-22 03:05:35,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:05:35,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:05:35,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:05:35,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:05:35,866 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2020-06-22 03:05:35,866 INFO L794 eck$LassoCheckResult]: Stem: 56329#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 56330#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56342#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56343#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56352#L15-1 [2020-06-22 03:05:35,867 INFO L796 eck$LassoCheckResult]: Loop: 56352#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56383#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56382#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56381#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56380#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56379#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56378#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56377#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56376#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56375#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56374#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56373#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56371#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56369#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56367#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56365#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56363#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56361#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56359#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56360#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56416#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56415#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56414#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56327#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56328#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56333#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56334#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56348#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56338#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56339#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56413#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56412#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56411#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56331#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56332#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56325#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56326#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56337#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56409#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56408#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56407#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56406#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56405#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56404#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56403#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56402#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56401#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56400#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56399#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56398#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56397#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56396#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56395#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56394#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56393#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56392#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56391#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56390#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56387#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56389#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56388#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56386#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56385#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56384#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56352#L15-1 [2020-06-22 03:05:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 7 times [2020-06-22 03:05:35,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:05:35,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:05:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:35,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:05:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1715574149, now seen corresponding path program 14 times [2020-06-22 03:05:35,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:05:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:05:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:35,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:05:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash -921203786, now seen corresponding path program 7 times [2020-06-22 03:05:35,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:05:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:05:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:35,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:05:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 297 proven. 78 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:05:35,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:05:35,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:05:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:05:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:35,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:35,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 297 proven. 78 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:05:36,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:05:36,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-06-22 03:05:36,346 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 60 [2020-06-22 03:05:36,357 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:05:36,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:05:36,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:05:36,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:05:36,357 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:05:36,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:36,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:05:36,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:05:36,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop [2020-06-22 03:05:36,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:05:36,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:05:36,359 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 03:05:36,362 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 03:05:36,368 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 03:05:36,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 03:05:36,432 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:05:36,432 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:36,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:05:36,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:05:36,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:05:36,470 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:36,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:05:36,477 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:36,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:05:36,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:05:36,516 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:05:36,541 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:05:36,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:05:36,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:05:36,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:05:36,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:05:36,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:05:36,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:05:36,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:05:36,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop [2020-06-22 03:05:36,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:05:36,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:05:36,543 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 03:05:36,546 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 03:05:36,548 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 03:05:36,553 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 03:05:36,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:05:36,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:05:36,598 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 03:05:36,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:05:36,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:05:36,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:05:36,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:05:36,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:05:36,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:05:36,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:05:36,602 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 03:05:36,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:05:36,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:05:36,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:05:36,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:05:36,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:05:36,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:05:36,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:05:36,605 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 03:05:36,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:05:36,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:05:36,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:05:36,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:05:36,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:05:36,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:05:36,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:05:36,608 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:05:36,609 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:05:36,609 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:05:36,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:05:36,610 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:05:36,610 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:05:36,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2020-06-22 03:05:36,610 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:05:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:05:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:36,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:36,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:37,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 03:05:37,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:38,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:38,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:39,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:39,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:39,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 03:05:39,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:39,178 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 29 predicates after loop cannibalization [2020-06-22 03:05:39,179 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 29 loop predicates [2020-06-22 03:05:39,179 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 102 states and 116 transitions. cyclomatic complexity: 16 Second operand 10 states. [2020-06-22 03:05:40,049 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 102 states and 116 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 734 states and 781 transitions. Complement of second has 116 states. [2020-06-22 03:05:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2020-06-22 03:05:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 03:05:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2020-06-22 03:05:40,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 90 transitions. Stem has 4 letters. Loop has 64 letters. [2020-06-22 03:05:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:05:40,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 90 transitions. Stem has 68 letters. Loop has 64 letters. [2020-06-22 03:05:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:05:40,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 90 transitions. Stem has 4 letters. Loop has 128 letters. [2020-06-22 03:05:40,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:05:40,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 734 states and 781 transitions. [2020-06-22 03:05:40,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-06-22 03:05:40,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 734 states to 194 states and 214 transitions. [2020-06-22 03:05:40,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2020-06-22 03:05:40,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2020-06-22 03:05:40,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 214 transitions. [2020-06-22 03:05:40,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:05:40,059 INFO L706 BuchiCegarLoop]: Abstraction has 194 states and 214 transitions. [2020-06-22 03:05:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 214 transitions. [2020-06-22 03:05:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 106. [2020-06-22 03:05:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-06-22 03:05:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2020-06-22 03:05:40,062 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-06-22 03:05:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 03:05:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 03:05:40,062 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 10 states. [2020-06-22 03:05:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:05:40,144 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2020-06-22 03:05:40,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 03:05:40,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 129 transitions. [2020-06-22 03:05:40,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-06-22 03:05:40,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 129 transitions. [2020-06-22 03:05:40,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2020-06-22 03:05:40,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2020-06-22 03:05:40,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 129 transitions. [2020-06-22 03:05:40,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:05:40,147 INFO L706 BuchiCegarLoop]: Abstraction has 114 states and 129 transitions. [2020-06-22 03:05:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 129 transitions. [2020-06-22 03:05:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2020-06-22 03:05:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-06-22 03:05:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2020-06-22 03:05:40,150 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-06-22 03:05:40,150 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-06-22 03:05:40,150 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2020-06-22 03:05:40,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 120 transitions. [2020-06-22 03:05:40,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2020-06-22 03:05:40,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:05:40,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:05:40,151 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:05:40,151 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2020-06-22 03:05:40,152 INFO L794 eck$LassoCheckResult]: Stem: 69758#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 69759#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69772#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69773#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 69780#L15-1 [2020-06-22 03:05:40,152 INFO L796 eck$LassoCheckResult]: Loop: 69780#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69811#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69810#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69809#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69808#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69807#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69806#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69805#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69804#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69803#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69802#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69801#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69800#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69799#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69798#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69797#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69796#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69795#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69794#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69793#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69792#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69790#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69787#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69788#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69845#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69844#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69843#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69756#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69757#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69770#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69778#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 69775#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69766#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69767#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69838#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69840#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69839#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69760#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69761#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69754#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69755#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69765#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69837#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69836#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69835#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69834#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69833#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69832#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69831#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69830#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69829#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69828#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69827#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69826#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69825#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69824#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69823#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69822#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69821#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69820#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69819#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69818#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69815#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69817#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69816#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69814#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69813#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69812#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 69780#L15-1 [2020-06-22 03:05:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 8 times [2020-06-22 03:05:40,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:05:40,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:05:40,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:40,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:05:40,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2016847575, now seen corresponding path program 15 times [2020-06-22 03:05:40,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:05:40,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:05:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:40,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:05:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:05:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash -170648440, now seen corresponding path program 8 times [2020-06-22 03:05:40,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:05:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:05:40,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:40,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:05:40,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:05:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 337 proven. 105 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:05:40,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:05:40,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:05:40,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 03:05:40,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 03:05:40,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:05:40,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:05:40,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 337 proven. 105 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:05:40,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:05:40,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-06-22 03:05:40,550 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2020-06-22 03:05:40,557 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:05:40,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:05:40,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:05:40,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:05:40,558 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:05:40,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:40,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:05:40,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:05:40,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop [2020-06-22 03:05:40,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:05:40,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:05:40,559 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 03:05:40,561 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 03:05:40,564 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 03:05:40,568 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 03:05:40,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:05:40,605 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:40,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:05:40,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:05:40,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:05:40,634 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:40,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:05:40,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:05:40,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:05:40,663 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:40,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:05:40,668 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:05:40,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:05:40,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:05:40,702 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:05:40,726 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:05:40,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:05:40,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:05:40,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:05:40,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:05:40,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:05:40,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:05:40,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:05:40,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop [2020-06-22 03:05:40,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:05:40,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:05:40,727 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 03:05:40,730 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 03:05:40,732 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 03:05:40,736 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 03:05:40,777 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:05:40,777 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:05:40,777 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 03:05:40,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:05:40,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:05:40,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:05:40,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:05:40,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:05:40,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:05:40,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:05:40,781 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 03:05:40,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:05:40,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:05:40,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:05:40,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:05:40,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:05:40,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:05:40,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:05:40,784 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 03:05:40,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:05:40,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:05:40,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:05:40,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:05:40,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:05:40,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:05:40,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:05:40,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:05:40,788 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:05:40,788 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 03:05:40,788 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:05:40,788 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:05:40,788 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:05:40,788 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-06-22 03:05:40,789 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:05:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:05:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:40,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:05:40,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:40,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:40,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-06-22 03:05:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:40,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:40,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:41,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:41,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:42,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:42,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:43,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:43,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:43,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:43,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:43,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:43,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:43,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:43,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:43,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:43,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:43,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:43,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:44,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:05:44,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:44,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:44,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:45,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 03:05:45,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:05:46,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:05:46,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:05:47,430 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 19 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true [2020-06-22 03:05:48,349 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:49,700 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:51,485 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:53,738 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:56,412 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:05:59,520 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:06:03,055 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:06:07,578 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-06-22 03:06:12,001 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-06-22 03:06:12,436 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_84 Int)) (<= 19 (+ (* 2 v_prenex_84) c_oldRank0))) is different from true [2020-06-22 03:06:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:12,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:12,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:12,887 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2050 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2050)))) is different from true [2020-06-22 03:06:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:13,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:13,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:13,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:13,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:14,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:14,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:14,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:14,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:15,314 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2083 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2083)))) is different from true [2020-06-22 03:06:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:15,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:16,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:16,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:16,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:16,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:17,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:17,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:17,740 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2116 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2116) c_oldRank0))) is different from true [2020-06-22 03:06:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:18,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:18,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:18,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:18,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:19,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:19,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:19,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:20,170 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2149 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2149) c_oldRank0))) is different from true [2020-06-22 03:06:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:20,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:20,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:21,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:21,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:21,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:21,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:22,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:22,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:22,594 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2182 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2182)))) is different from true [2020-06-22 03:06:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:23,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:23,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:23,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:23,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:24,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:24,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:24,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:24,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:25,024 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2215 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2215) c_oldRank0))) is different from true [2020-06-22 03:06:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:25,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:25,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:26,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:26,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:26,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:26,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:27,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:27,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:27,446 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2248 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2248) c_oldRank0))) is different from true [2020-06-22 03:06:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:27,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:27,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:28,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:28,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:28,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:28,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:29,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:29,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:29,919 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2281 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2281)))) is different from true [2020-06-22 03:06:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:30,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:30,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:30,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:30,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:31,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:31,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:31,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:31,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:32,332 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2314 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2314) c_oldRank0))) is different from true [2020-06-22 03:06:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:32,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:32,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:33,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:33,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:06:33,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 03:06:33,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:06:33,337 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 56 predicates after loop cannibalization [2020-06-22 03:06:33,337 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 56 loop predicates [2020-06-22 03:06:33,338 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 106 states and 120 transitions. cyclomatic complexity: 16 Second operand 11 states. [2020-06-22 03:06:51,461 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 106 states and 120 transitions. cyclomatic complexity: 16. Second operand 11 states. Result 862 states and 909 transitions. Complement of second has 188 states. [2020-06-22 03:06:51,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 1 stem states 27 non-accepting loop states 1 accepting loop states [2020-06-22 03:06:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 03:06:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2020-06-22 03:06:51,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 128 transitions. Stem has 4 letters. Loop has 68 letters. [2020-06-22 03:06:51,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:06:51,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 128 transitions. Stem has 72 letters. Loop has 68 letters. [2020-06-22 03:06:51,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:06:51,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 128 transitions. Stem has 4 letters. Loop has 136 letters. [2020-06-22 03:06:51,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:06:51,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 862 states and 909 transitions. [2020-06-22 03:06:51,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2020-06-22 03:06:51,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 862 states to 189 states and 204 transitions. [2020-06-22 03:06:51,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2020-06-22 03:06:51,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2020-06-22 03:06:51,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 204 transitions. [2020-06-22 03:06:51,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:06:51,471 INFO L706 BuchiCegarLoop]: Abstraction has 189 states and 204 transitions. [2020-06-22 03:06:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 204 transitions. [2020-06-22 03:06:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 153. [2020-06-22 03:06:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-06-22 03:06:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2020-06-22 03:06:51,475 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 168 transitions. [2020-06-22 03:06:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 03:06:51,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 03:06:51,475 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand 11 states. [2020-06-22 03:06:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:06:51,566 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2020-06-22 03:06:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 03:06:51,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 198 transitions. [2020-06-22 03:06:51,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2020-06-22 03:06:51,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 150 states and 163 transitions. [2020-06-22 03:06:51,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2020-06-22 03:06:51,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2020-06-22 03:06:51,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 163 transitions. [2020-06-22 03:06:51,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:06:51,571 INFO L706 BuchiCegarLoop]: Abstraction has 150 states and 163 transitions. [2020-06-22 03:06:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 163 transitions. [2020-06-22 03:06:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2020-06-22 03:06:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-06-22 03:06:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2020-06-22 03:06:51,573 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 118 transitions. [2020-06-22 03:06:51,573 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 118 transitions. [2020-06-22 03:06:51,573 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2020-06-22 03:06:51,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 118 transitions. [2020-06-22 03:06:51,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2020-06-22 03:06:51,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:06:51,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:06:51,575 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:06:51,575 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2020-06-22 03:06:51,575 INFO L794 eck$LassoCheckResult]: Stem: 85124#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 85125#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85137#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85138#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 85143#L15-1 [2020-06-22 03:06:51,576 INFO L796 eck$LassoCheckResult]: Loop: 85143#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85177#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85176#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85175#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85174#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85173#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85172#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85171#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85170#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85169#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85168#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85167#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85166#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85165#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85164#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85163#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85162#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85161#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85160#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85159#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85158#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85157#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85156#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85155#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85154#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85153#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85151#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85152#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85183#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85181#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85144#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85122#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85123#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85128#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85129#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 85140#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85133#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85134#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85130#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85120#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85121#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85126#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85127#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85225#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85224#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85223#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85222#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85221#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85220#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85219#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85218#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85217#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85216#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85215#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85214#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85213#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85212#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85211#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85210#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85209#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85208#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85207#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85206#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85205#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85204#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85203#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85185#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85184#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85182#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85180#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85179#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85178#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 85143#L15-1 [2020-06-22 03:06:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:06:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 9 times [2020-06-22 03:06:51,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:06:51,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:06:51,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:06:51,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:06:51,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:06:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:06:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:06:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:06:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098345, now seen corresponding path program 16 times [2020-06-22 03:06:51,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:06:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:06:51,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:06:51,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:06:51,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:06:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:06:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:06:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:06:51,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1566045274, now seen corresponding path program 9 times [2020-06-22 03:06:51,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:06:51,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:06:51,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:06:51,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:06:51,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:06:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:06:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:06:51,874 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 [2020-06-22 03:06:51,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:06:51 BasicIcfg [2020-06-22 03:06:51,923 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 03:06:51,923 INFO L168 Benchmark]: Toolchain (without parser) took 190293.11 ms. Allocated memory was 649.6 MB in the beginning and 917.0 MB in the end (delta: 267.4 MB). Free memory was 558.8 MB in the beginning and 514.2 MB in the end (delta: 44.5 MB). Peak memory consumption was 311.9 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,924 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:06:51,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.31 ms. Allocated memory was 649.6 MB in the beginning and 658.0 MB in the end (delta: 8.4 MB). Free memory was 558.8 MB in the beginning and 625.7 MB in the end (delta: -67.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 658.0 MB. Free memory was 625.7 MB in the beginning and 623.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,925 INFO L168 Benchmark]: Boogie Preprocessor took 19.97 ms. Allocated memory is still 658.0 MB. Free memory was 623.0 MB in the beginning and 621.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,925 INFO L168 Benchmark]: RCFGBuilder took 211.62 ms. Allocated memory is still 658.0 MB. Free memory was 619.9 MB in the beginning and 606.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,926 INFO L168 Benchmark]: BlockEncodingV2 took 86.97 ms. Allocated memory is still 658.0 MB. Free memory was 606.9 MB in the beginning and 601.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,926 INFO L168 Benchmark]: TraceAbstraction took 158.57 ms. Allocated memory is still 658.0 MB. Free memory was 601.5 MB in the beginning and 593.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,926 INFO L168 Benchmark]: BuchiAutomizer took 189498.30 ms. Allocated memory was 658.0 MB in the beginning and 917.0 MB in the end (delta: 259.0 MB). Free memory was 591.9 MB in the beginning and 514.2 MB in the end (delta: 77.7 MB). Peak memory consumption was 336.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:06:51,930 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 277.31 ms. Allocated memory was 649.6 MB in the beginning and 658.0 MB in the end (delta: 8.4 MB). Free memory was 558.8 MB in the beginning and 625.7 MB in the end (delta: -67.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 658.0 MB. Free memory was 625.7 MB in the beginning and 623.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.97 ms. Allocated memory is still 658.0 MB. Free memory was 623.0 MB in the beginning and 621.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 211.62 ms. Allocated memory is still 658.0 MB. Free memory was 619.9 MB in the beginning and 606.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 86.97 ms. Allocated memory is still 658.0 MB. Free memory was 606.9 MB in the beginning and 601.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 158.57 ms. Allocated memory is still 658.0 MB. Free memory was 601.5 MB in the beginning and 593.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 189498.30 ms. Allocated memory was 658.0 MB in the beginning and 917.0 MB in the end (delta: 259.0 MB). Free memory was 591.9 MB in the beginning and 514.2 MB in the end (delta: 77.7 MB). Peak memory consumption was 336.7 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. - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s 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=5occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 32 terminating modules (20 trivial, 0 deterministic, 12 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function -1 * i + 5 and consists of 14 locations. One nondeterministic module has affine ranking function -2 * i + 13 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 7 and consists of 11 locations. One nondeterministic module has affine ranking function -2 * i + 15 and consists of 7 locations. One nondeterministic module has affine ranking function -1 * i + 8 and consists of 15 locations. One nondeterministic module has affine ranking function -2 * i + 17 and consists of 9 locations. One nondeterministic module has affine ranking function -1 * i + 9 and consists of 23 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 30 locations. 20 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 189.4s and 23 iterations. TraceHistogramMax:18. Analysis of lassos took 7.9s. Construction of modules took 2.0s. Büchi inclusion checks took 179.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 31. Automata minimization 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 1196 StatesRemovedByMinimization, 31 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 161 states and ocurred in iteration 3. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1242/2784 HoareTripleCheckerStatistics: 155 SDtfs, 919 SDslu, 32 SDs, 0 SdLazy, 2524 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT2 conc0 concLT9 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax184 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf89 smp97 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b925337=0, \result=0, i=10} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 Loop: [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 03:03:38.461 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 03:06:52.170 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check