./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/nested9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:34:11,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:34:11,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:34:11,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:34:11,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:34:11,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:34:11,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:34:11,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:34:11,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:34:11,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:34:11,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:34:11,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:34:11,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:34:11,484 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:34:11,485 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:34:11,485 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:34:11,485 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:34:11,486 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:34:11,486 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:34:11,486 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:34:11,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:34:11,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:34:11,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:34:11,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:34:11,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:34:11,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:34:11,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:34:11,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:34:11,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:34:11,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:34:11,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:34:11,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:34:11,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:34:11,491 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:34:11,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:34:11,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:34:11,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:34:11,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:34:11,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:34:11,493 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:34:11,494 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a [2024-11-17 08:34:11,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:34:11,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:34:11,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:34:11,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:34:11,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:34:11,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested9.i [2024-11-17 08:34:13,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:34:13,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:34:13,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i [2024-11-17 08:34:13,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f87d7623/57d528018d6e43cf8673c9a12f487944/FLAG78a5c4fad [2024-11-17 08:34:13,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f87d7623/57d528018d6e43cf8673c9a12f487944 [2024-11-17 08:34:13,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:34:13,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:34:13,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:34:13,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:34:13,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:34:13,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72509e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13, skipping insertion in model container [2024-11-17 08:34:13,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:34:13,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:34:13,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:34:13,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:34:13,665 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:34:13,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13 WrapperNode [2024-11-17 08:34:13,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:34:13,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:34:13,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:34:13,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:34:13,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,692 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-17 08:34:13,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:34:13,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:34:13,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:34:13,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:34:13,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,713 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:34:13,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:34:13,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:34:13,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:34:13,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:34:13,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (1/1) ... [2024-11-17 08:34:13,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:34:13,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:34:13,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:34:13,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:34:13,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:34:13,860 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:34:13,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:34:14,018 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-17 08:34:14,018 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:34:14,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:34:14,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:34:14,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:14 BoogieIcfgContainer [2024-11-17 08:34:14,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:34:14,029 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:34:14,029 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:34:14,032 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:34:14,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:14,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:34:13" (1/3) ... [2024-11-17 08:34:14,033 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aa85c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:34:14, skipping insertion in model container [2024-11-17 08:34:14,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:14,033 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:13" (2/3) ... [2024-11-17 08:34:14,034 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aa85c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:34:14, skipping insertion in model container [2024-11-17 08:34:14,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:14,034 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:14" (3/3) ... [2024-11-17 08:34:14,035 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested9.i [2024-11-17 08:34:14,086 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:34:14,087 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:34:14,087 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:34:14,087 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:34:14,087 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:34:14,087 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:34:14,087 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:34:14,088 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:34:14,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:14,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:34:14,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:14,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:14,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:34:14,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:34:14,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:34:14,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:14,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:34:14,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:14,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:14,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:34:14,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:34:14,126 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 15#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 12#L30-1true assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 20#L31-1true assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 7#L32-1true assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 8#L33-1true assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 16#L34true [2024-11-17 08:34:14,126 INFO L747 eck$LassoCheckResult]: Loop: 16#L34true assume true; 11#L34-2true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23#L35true assume !true; 17#L34-1true main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 16#L34true [2024-11-17 08:34:14,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2047612806, now seen corresponding path program 1 times [2024-11-17 08:34:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384620610] [2024-11-17 08:34:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1815115, now seen corresponding path program 1 times [2024-11-17 08:34:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516754052] [2024-11-17 08:34:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516754052] [2024-11-17 08:34:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516754052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:14,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:34:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214403221] [2024-11-17 08:34:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:14,324 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:34:14,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:34:14,360 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:14,369 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2024-11-17 08:34:14,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2024-11-17 08:34:14,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-17 08:34:14,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 18 transitions. [2024-11-17 08:34:14,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:34:14,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:34:14,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2024-11-17 08:34:14,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:14,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-17 08:34:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2024-11-17 08:34:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-17 08:34:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-17 08:34:14,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-17 08:34:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:34:14,408 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-17 08:34:14,408 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:34:14,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-11-17 08:34:14,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-17 08:34:14,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:14,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:14,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:34:14,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:34:14,409 INFO L745 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 54#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 62#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 63#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 55#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 56#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 57#L34 [2024-11-17 08:34:14,410 INFO L747 eck$LassoCheckResult]: Loop: 57#L34 assume true; 60#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 61#L35 assume true; 68#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57#L34 [2024-11-17 08:34:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2047612806, now seen corresponding path program 2 times [2024-11-17 08:34:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166790533] [2024-11-17 08:34:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash 56268134, now seen corresponding path program 1 times [2024-11-17 08:34:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744166564] [2024-11-17 08:34:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash -267251571, now seen corresponding path program 1 times [2024-11-17 08:34:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19365672] [2024-11-17 08:34:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,589 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:14,590 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:14,590 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:14,590 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:14,590 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:14,590 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,590 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:14,590 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:14,591 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop [2024-11-17 08:34:14,591 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:14,591 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:14,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:14,681 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:14,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:34:14,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:14,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:14,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:14,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:34:14,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:14,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:14,764 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:14,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:14,769 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:14,769 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:14,769 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:14,770 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:14,770 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:14,770 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,770 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:14,770 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:14,770 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop [2024-11-17 08:34:14,770 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:14,770 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:14,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,824 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:14,828 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:14,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:34:14,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:14,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:14,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:14,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:14,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:14,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:14,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:14,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:14,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:14,861 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:14,861 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:14,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:34:14,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:14,886 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:14,886 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:14,887 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-17 08:34:14,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:14,902 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,959 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:15,014 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:34:15,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:15,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 8 states. [2024-11-17 08:34:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2024-11-17 08:34:15,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 5 letters. [2024-11-17 08:34:15,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:15,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 11 letters. Loop has 5 letters. [2024-11-17 08:34:15,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:15,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 10 letters. [2024-11-17 08:34:15,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:15,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2024-11-17 08:34:15,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-17 08:34:15,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 53 transitions. [2024-11-17 08:34:15,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:34:15,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-17 08:34:15,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 53 transitions. [2024-11-17 08:34:15,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:15,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-17 08:34:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 53 transitions. [2024-11-17 08:34:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2024-11-17 08:34:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-17 08:34:15,105 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-17 08:34:15,105 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-17 08:34:15,105 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:34:15,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2024-11-17 08:34:15,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-17 08:34:15,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:15,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:15,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:15,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:15,107 INFO L745 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 174#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 186#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 187#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 175#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 176#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 177#L34 assume true; 182#L34-2 [2024-11-17 08:34:15,107 INFO L747 eck$LassoCheckResult]: Loop: 182#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 183#L35 assume true; 201#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 178#L36 assume true; 179#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 192#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 193#L35 assume true; 204#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 198#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 196#L34 assume true; 182#L34-2 [2024-11-17 08:34:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 948512483, now seen corresponding path program 1 times [2024-11-17 08:34:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428043893] [2024-11-17 08:34:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:15,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:15,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:15,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash 668847236, now seen corresponding path program 1 times [2024-11-17 08:34:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800146846] [2024-11-17 08:34:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800146846] [2024-11-17 08:34:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800146846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:34:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800103553] [2024-11-17 08:34:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:15,221 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:15,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:34:15,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:34:15,222 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:15,258 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-17 08:34:15,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2024-11-17 08:34:15,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-17 08:34:15,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 44 transitions. [2024-11-17 08:34:15,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:34:15,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:34:15,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2024-11-17 08:34:15,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:15,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-17 08:34:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2024-11-17 08:34:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-17 08:34:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-17 08:34:15,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-17 08:34:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:34:15,264 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-17 08:34:15,265 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:34:15,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2024-11-17 08:34:15,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-17 08:34:15,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:15,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:15,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:15,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:15,269 INFO L745 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 253#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 265#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 266#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 254#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 255#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 256#L34 assume true; 261#L34-2 [2024-11-17 08:34:15,269 INFO L747 eck$LassoCheckResult]: Loop: 261#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 262#L35 assume true; 281#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 257#L36 assume true; 258#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 267#L18 assume !(0 == __VERIFIER_assert_~cond#1); 268#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 279#L36 assume true; 284#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 271#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 272#L35 assume true; 283#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 277#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 275#L34 assume true; 261#L34-2 [2024-11-17 08:34:15,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 948512483, now seen corresponding path program 2 times [2024-11-17 08:34:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548552736] [2024-11-17 08:34:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:15,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:15,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:15,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:15,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -486920532, now seen corresponding path program 1 times [2024-11-17 08:34:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372815755] [2024-11-17 08:34:15,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:15,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:15,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -583228914, now seen corresponding path program 1 times [2024-11-17 08:34:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525281135] [2024-11-17 08:34:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525281135] [2024-11-17 08:34:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525281135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:15,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:34:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022285184] [2024-11-17 08:34:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:15,573 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:15,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:15,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:15,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:15,573 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:15,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:15,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:15,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop [2024-11-17 08:34:15,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:15,574 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:15,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:34:15,667 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:15,667 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:15,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:15,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:34:15,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:15,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:15,689 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:15,689 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:15,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:34:15,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:15,705 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:15,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:34:15,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:15,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:15,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:15,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:15,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:15,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:34:15,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:15,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:15,774 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:15,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:15,789 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:15,789 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:15,789 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:15,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:15,789 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:15,789 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:15,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:15,789 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop [2024-11-17 08:34:15,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:15,790 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:15,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:15,861 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:15,861 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:15,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:15,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:34:15,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:15,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:15,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:15,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:15,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:15,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:15,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:15,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:15,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:15,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:34:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:15,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:15,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:34:15,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:15,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:15,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:15,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:15,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:15,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:15,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:15,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:15,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:15,918 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:15,918 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:15,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:15,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:15,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:34:15,922 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:15,922 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:15,922 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:15,922 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 3 Supporting invariants [] [2024-11-17 08:34:15,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:15,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:15,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:15,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:15,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:15,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:34:15,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:16,133 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-17 08:34:16,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:16,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 162 states and 193 transitions. Complement of second has 18 states. [2024-11-17 08:34:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2024-11-17 08:34:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 49 transitions. Stem has 7 letters. Loop has 14 letters. [2024-11-17 08:34:16,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 49 transitions. Stem has 21 letters. Loop has 14 letters. [2024-11-17 08:34:16,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 49 transitions. Stem has 7 letters. Loop has 28 letters. [2024-11-17 08:34:16,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:16,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 193 transitions. [2024-11-17 08:34:16,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2024-11-17 08:34:16,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 145 states and 173 transitions. [2024-11-17 08:34:16,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-17 08:34:16,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-17 08:34:16,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 173 transitions. [2024-11-17 08:34:16,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:16,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 173 transitions. [2024-11-17 08:34:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 173 transitions. [2024-11-17 08:34:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2024-11-17 08:34:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 116 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2024-11-17 08:34:16,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 142 transitions. [2024-11-17 08:34:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:16,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:34:16,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:34:16,372 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:16,401 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2024-11-17 08:34:16,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 158 transitions. [2024-11-17 08:34:16,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2024-11-17 08:34:16,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 122 states and 145 transitions. [2024-11-17 08:34:16,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-17 08:34:16,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-17 08:34:16,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 145 transitions. [2024-11-17 08:34:16,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:16,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 145 transitions. [2024-11-17 08:34:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 145 transitions. [2024-11-17 08:34:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-17 08:34:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 119 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2024-11-17 08:34:16,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 143 transitions. [2024-11-17 08:34:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:34:16,419 INFO L425 stractBuchiCegarLoop]: Abstraction has 120 states and 143 transitions. [2024-11-17 08:34:16,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:34:16,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 143 transitions. [2024-11-17 08:34:16,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2024-11-17 08:34:16,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:16,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:16,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:16,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:16,421 INFO L745 eck$LassoCheckResult]: Stem: 815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 816#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 828#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 829#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 817#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 818#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 819#L34 assume true; 838#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 853#L35 assume true; 847#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 848#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 862#L34 assume true; 858#L34-2 [2024-11-17 08:34:16,421 INFO L747 eck$LassoCheckResult]: Loop: 858#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 851#L35 assume true; 852#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 855#L36 assume true; 871#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 834#L18 assume !(0 == __VERIFIER_assert_~cond#1); 835#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 843#L36 assume true; 868#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 861#L18 assume !(0 == __VERIFIER_assert_~cond#1); 864#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 863#L36 assume true; 860#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 857#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 856#L35 assume true; 854#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 840#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 841#L34 assume true; 858#L34-2 [2024-11-17 08:34:16,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 305135920, now seen corresponding path program 2 times [2024-11-17 08:34:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859152344] [2024-11-17 08:34:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:16,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:16,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:16,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:16,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash 390675668, now seen corresponding path program 2 times [2024-11-17 08:34:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811946063] [2024-11-17 08:34:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:16,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:16,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811946063] [2024-11-17 08:34:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811946063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:16,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567199835] [2024-11-17 08:34:16,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:34:16,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:16,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:16,559 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:16,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 08:34:16,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:34:16,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:16,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:34:16,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:16,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:16,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567199835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:16,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:16,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-17 08:34:16,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289050649] [2024-11-17 08:34:16,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:16,866 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:16,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:16,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 08:34:16,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-17 08:34:16,867 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:16,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:17,012 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2024-11-17 08:34:17,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 259 transitions. [2024-11-17 08:34:17,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2024-11-17 08:34:17,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 259 transitions. [2024-11-17 08:34:17,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-17 08:34:17,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-17 08:34:17,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 259 transitions. [2024-11-17 08:34:17,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:17,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 259 transitions. [2024-11-17 08:34:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 259 transitions. [2024-11-17 08:34:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 172. [2024-11-17 08:34:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.1744186046511629) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2024-11-17 08:34:17,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 172 states and 202 transitions. [2024-11-17 08:34:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:34:17,031 INFO L425 stractBuchiCegarLoop]: Abstraction has 172 states and 202 transitions. [2024-11-17 08:34:17,031 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:34:17,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 202 transitions. [2024-11-17 08:34:17,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2024-11-17 08:34:17,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:17,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:17,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:17,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-17 08:34:17,034 INFO L745 eck$LassoCheckResult]: Stem: 1284#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 1285#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1296#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1297#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1286#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1287#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 1288#L34 assume true; 1306#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1361#L35 assume true; 1400#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1407#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1332#L34 assume true; 1331#L34-2 [2024-11-17 08:34:17,034 INFO L747 eck$LassoCheckResult]: Loop: 1331#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1323#L35 assume true; 1324#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1350#L36 assume true; 1349#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1298#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1299#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1348#L36 assume true; 1347#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1344#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1346#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1345#L36 assume true; 1343#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 1342#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1341#L35 assume true; 1340#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1326#L36 assume true; 1339#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1338#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1337#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1336#L36 assume true; 1335#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1330#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1334#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1333#L36 assume true; 1329#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 1328#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1327#L35 assume true; 1325#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1309#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1310#L34 assume true; 1331#L34-2 [2024-11-17 08:34:17,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 305135920, now seen corresponding path program 3 times [2024-11-17 08:34:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059161995] [2024-11-17 08:34:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:17,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:17,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:17,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash 361954834, now seen corresponding path program 3 times [2024-11-17 08:34:17,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:17,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883217252] [2024-11-17 08:34:17,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:17,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 08:34:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883217252] [2024-11-17 08:34:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883217252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846634636] [2024-11-17 08:34:17,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:34:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:17,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:17,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 08:34:17,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-17 08:34:17,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:17,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:34:17,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 08:34:17,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 08:34:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846634636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:17,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-17 08:34:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774631052] [2024-11-17 08:34:17,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:17,500 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:17,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:17,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 08:34:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-17 08:34:17,501 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. cyclomatic complexity: 35 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:17,601 INFO L93 Difference]: Finished difference Result 229 states and 256 transitions. [2024-11-17 08:34:17,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 256 transitions. [2024-11-17 08:34:17,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2024-11-17 08:34:17,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 229 states and 256 transitions. [2024-11-17 08:34:17,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-11-17 08:34:17,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-11-17 08:34:17,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 256 transitions. [2024-11-17 08:34:17,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:17,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 229 states and 256 transitions. [2024-11-17 08:34:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 256 transitions. [2024-11-17 08:34:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2024-11-17 08:34:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 212 states have (on average 1.1273584905660377) internal successors, (239), 211 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 239 transitions. [2024-11-17 08:34:17,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 212 states and 239 transitions. [2024-11-17 08:34:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:34:17,622 INFO L425 stractBuchiCegarLoop]: Abstraction has 212 states and 239 transitions. [2024-11-17 08:34:17,622 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:34:17,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 239 transitions. [2024-11-17 08:34:17,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-11-17 08:34:17,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:17,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:17,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:17,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-17 08:34:17,624 INFO L745 eck$LassoCheckResult]: Stem: 1890#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 1891#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1902#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1903#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1892#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1893#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 1894#L34 assume true; 1912#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1975#L35 assume true; 2042#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 2041#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1935#L34 assume true; 1936#L34-2 [2024-11-17 08:34:17,624 INFO L747 eck$LassoCheckResult]: Loop: 1936#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1925#L35 assume true; 1926#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1959#L36 assume true; 1958#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1957#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1956#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1955#L36 assume true; 1954#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1951#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1953#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1952#L36 assume true; 1950#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 1949#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1948#L35 assume true; 1947#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1928#L36 assume true; 1946#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1945#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1944#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1943#L36 assume true; 1942#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1941#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1940#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1939#L36 assume true; 1938#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1932#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1934#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1933#L36 assume true; 1931#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 1930#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1929#L35 assume true; 1927#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1915#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1916#L34 assume true; 1936#L34-2 [2024-11-17 08:34:17,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash 305135920, now seen corresponding path program 4 times [2024-11-17 08:34:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34863497] [2024-11-17 08:34:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:17,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:17,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1468012230, now seen corresponding path program 4 times [2024-11-17 08:34:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243028728] [2024-11-17 08:34:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:17,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:17,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:17,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2133041579, now seen corresponding path program 2 times [2024-11-17 08:34:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:17,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013684984] [2024-11-17 08:34:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 08:34:17,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013684984] [2024-11-17 08:34:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013684984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552149753] [2024-11-17 08:34:17,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:34:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:17,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:17,753 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:17,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 08:34:17,808 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:34:17,809 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:17,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:34:17,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-17 08:34:17,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-17 08:34:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552149753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:17,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-17 08:34:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049768693] [2024-11-17 08:34:17,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:18,168 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:18,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:18,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:18,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:18,169 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:18,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:18,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:18,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration7_Loop [2024-11-17 08:34:18,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:18,169 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:18,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,223 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:18,223 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:18,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,225 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:34:18,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:18,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:18,245 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:18,246 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:18,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:18,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,262 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:34:18,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:18,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:18,277 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:18,278 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:18,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,291 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:34:18,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:18,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:18,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,322 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:34:18,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:18,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:18,339 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:18,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:34:18,349 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:18,349 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:18,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:18,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:18,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:18,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:18,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:18,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration7_Loop [2024-11-17 08:34:18,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:18,350 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:18,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:18,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:18,412 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:18,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,414 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:34:18,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:18,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:18,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:18,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:18,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:18,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:18,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:18,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:18,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:18,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,448 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:34:18,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:18,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:18,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:18,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:18,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:18,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:18,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:18,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:18,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:18,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:34:18,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,484 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:34:18,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:18,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:18,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:18,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:18,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:18,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:18,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:18,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:18,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:18,510 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:18,510 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:18,512 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:18,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:34:18,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:18,515 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:18,515 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:18,515 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2024-11-17 08:34:18,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-17 08:34:18,531 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:18,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:18,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:18,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:34:18,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 08:34:18,791 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2024-11-17 08:34:18,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 239 transitions. cyclomatic complexity: 32 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 239 transitions. cyclomatic complexity: 32. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 681 states and 760 transitions. Complement of second has 22 states. [2024-11-17 08:34:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2024-11-17 08:34:19,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 12 letters. Loop has 35 letters. [2024-11-17 08:34:19,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:19,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 47 letters. Loop has 35 letters. [2024-11-17 08:34:19,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:19,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 12 letters. Loop has 70 letters. [2024-11-17 08:34:19,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:19,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 681 states and 760 transitions. [2024-11-17 08:34:19,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 81 [2024-11-17 08:34:19,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 681 states to 460 states and 514 transitions. [2024-11-17 08:34:19,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-17 08:34:19,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-17 08:34:19,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 460 states and 514 transitions. [2024-11-17 08:34:19,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:19,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 460 states and 514 transitions. [2024-11-17 08:34:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states and 514 transitions. [2024-11-17 08:34:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 347. [2024-11-17 08:34:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 347 states have (on average 1.1354466858789625) internal successors, (394), 346 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 394 transitions. [2024-11-17 08:34:19,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 347 states and 394 transitions. [2024-11-17 08:34:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:34:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:34:19,025 INFO L87 Difference]: Start difference. First operand 347 states and 394 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-17 08:34:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:19,173 INFO L93 Difference]: Finished difference Result 421 states and 470 transitions. [2024-11-17 08:34:19,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 421 states and 470 transitions. [2024-11-17 08:34:19,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2024-11-17 08:34:19,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 421 states to 372 states and 419 transitions. [2024-11-17 08:34:19,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-17 08:34:19,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-17 08:34:19,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 419 transitions. [2024-11-17 08:34:19,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:19,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 372 states and 419 transitions. [2024-11-17 08:34:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 419 transitions. [2024-11-17 08:34:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2024-11-17 08:34:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 369 states have (on average 1.127371273712737) internal successors, (416), 368 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 416 transitions. [2024-11-17 08:34:19,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 369 states and 416 transitions. [2024-11-17 08:34:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:34:19,187 INFO L425 stractBuchiCegarLoop]: Abstraction has 369 states and 416 transitions. [2024-11-17 08:34:19,187 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:34:19,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 416 transitions. [2024-11-17 08:34:19,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2024-11-17 08:34:19,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:19,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:19,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:19,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-17 08:34:19,192 INFO L745 eck$LassoCheckResult]: Stem: 4044#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 4045#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4057#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 4058#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 4046#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 4047#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 4048#L34 assume true; 4067#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4136#L35 assume true; 4133#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4130#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4131#L34 assume true; 4184#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4185#L35 assume true; 4177#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 4178#L36 assume true; 4170#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4171#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4166#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4167#L36 assume true; 4148#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 4137#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4138#L35 assume true; 4132#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4125#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4126#L34 assume true; 4123#L34-2 [2024-11-17 08:34:19,192 INFO L747 eck$LassoCheckResult]: Loop: 4123#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4121#L35 assume true; 4120#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 4119#L36 assume true; 4117#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4115#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4114#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4112#L36 assume true; 4110#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4109#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4108#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4107#L36 assume true; 4106#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4103#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4105#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4104#L36 assume true; 4102#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 4099#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4098#L35 assume true; 4097#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 4081#L36 assume true; 4096#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4095#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4094#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4093#L36 assume true; 4092#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4090#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4089#L36 assume true; 4088#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4085#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4087#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4086#L36 assume true; 4084#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 4083#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4082#L35 assume true; 4080#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4070#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4071#L34 assume true; 4123#L34-2 [2024-11-17 08:34:19,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1143148133, now seen corresponding path program 3 times [2024-11-17 08:34:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:19,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076550303] [2024-11-17 08:34:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:19,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:19,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:19,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash -525679598, now seen corresponding path program 5 times [2024-11-17 08:34:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20030423] [2024-11-17 08:34:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20030423] [2024-11-17 08:34:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20030423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408021433] [2024-11-17 08:34:19,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:34:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:19,355 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:19,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-17 08:34:19,400 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-17 08:34:19,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:19,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:19,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:19,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408021433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:19,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:19,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2024-11-17 08:34:19,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605283722] [2024-11-17 08:34:19,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:19,547 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:19,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 08:34:19,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-17 08:34:19,548 INFO L87 Difference]: Start difference. First operand 369 states and 416 transitions. cyclomatic complexity: 55 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:19,723 INFO L93 Difference]: Finished difference Result 541 states and 599 transitions. [2024-11-17 08:34:19,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 599 transitions. [2024-11-17 08:34:19,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2024-11-17 08:34:19,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 541 states and 599 transitions. [2024-11-17 08:34:19,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2024-11-17 08:34:19,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2024-11-17 08:34:19,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 541 states and 599 transitions. [2024-11-17 08:34:19,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:19,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 541 states and 599 transitions. [2024-11-17 08:34:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states and 599 transitions. [2024-11-17 08:34:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 436. [2024-11-17 08:34:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 436 states have (on average 1.1169724770642202) internal successors, (487), 435 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 487 transitions. [2024-11-17 08:34:19,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 436 states and 487 transitions. [2024-11-17 08:34:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 08:34:19,738 INFO L425 stractBuchiCegarLoop]: Abstraction has 436 states and 487 transitions. [2024-11-17 08:34:19,738 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:34:19,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 436 states and 487 transitions. [2024-11-17 08:34:19,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2024-11-17 08:34:19,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:19,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:19,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:19,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 7, 7, 7, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-17 08:34:19,741 INFO L745 eck$LassoCheckResult]: Stem: 5214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 5215#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 5227#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 5228#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 5216#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 5217#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 5218#L34 assume true; 5237#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 5316#L35 assume true; 5313#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 5312#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5310#L34 assume true; 5223#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 5224#L35 assume true; 5246#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 5247#L36 assume true; 5638#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5637#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5636#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5635#L36 assume true; 5627#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 5628#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5649#L35 assume true; 5517#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 5515#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5514#L34 assume true; 5291#L34-2 [2024-11-17 08:34:19,741 INFO L747 eck$LassoCheckResult]: Loop: 5291#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 5290#L35 assume true; 5289#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 5288#L36 assume true; 5287#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5286#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5285#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5284#L36 assume true; 5283#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5282#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5281#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5280#L36 assume true; 5279#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5276#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5278#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5277#L36 assume true; 5275#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 5274#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5273#L35 assume true; 5272#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 5252#L36 assume true; 5271#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5269#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5268#L36 assume true; 5267#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5265#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5264#L36 assume true; 5263#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5261#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5260#L36 assume true; 5259#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5256#L18 assume !(0 == __VERIFIER_assert_~cond#1); 5258#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5257#L36 assume true; 5255#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 5254#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5253#L35 assume true; 5251#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 5240#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5241#L34 assume true; 5291#L34-2 [2024-11-17 08:34:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1143148133, now seen corresponding path program 4 times [2024-11-17 08:34:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127938080] [2024-11-17 08:34:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:19,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:19,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -163270854, now seen corresponding path program 6 times [2024-11-17 08:34:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204144722] [2024-11-17 08:34:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 8 proven. 81 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-17 08:34:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204144722] [2024-11-17 08:34:19,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204144722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307738653] [2024-11-17 08:34:19,859 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:34:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:19,862 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:19,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-17 08:34:19,917 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-17 08:34:19,918 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:19,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:34:19,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 8 proven. 81 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-17 08:34:20,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 71 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-17 08:34:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307738653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:20,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-17 08:34:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772298942] [2024-11-17 08:34:20,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:20,301 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 08:34:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-17 08:34:20,302 INFO L87 Difference]: Start difference. First operand 436 states and 487 transitions. cyclomatic complexity: 59 Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:20,470 INFO L93 Difference]: Finished difference Result 679 states and 742 transitions. [2024-11-17 08:34:20,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 679 states and 742 transitions. [2024-11-17 08:34:20,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 104 [2024-11-17 08:34:20,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 679 states to 679 states and 742 transitions. [2024-11-17 08:34:20,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2024-11-17 08:34:20,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2024-11-17 08:34:20,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 679 states and 742 transitions. [2024-11-17 08:34:20,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:20,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 679 states and 742 transitions. [2024-11-17 08:34:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 742 transitions. [2024-11-17 08:34:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 562. [2024-11-17 08:34:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.101423487544484) internal successors, (619), 561 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 619 transitions. [2024-11-17 08:34:20,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 562 states and 619 transitions. [2024-11-17 08:34:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 08:34:20,487 INFO L425 stractBuchiCegarLoop]: Abstraction has 562 states and 619 transitions. [2024-11-17 08:34:20,487 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:34:20,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 619 transitions. [2024-11-17 08:34:20,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2024-11-17 08:34:20,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:20,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:20,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:20,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 11, 11, 11, 4, 3, 3, 3, 1, 1, 1, 1] [2024-11-17 08:34:20,490 INFO L745 eck$LassoCheckResult]: Stem: 6617#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 6618#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 6629#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 6630#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 6619#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 6620#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 6621#L34 assume true; 6639#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6743#L35 assume true; 6735#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6733#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6729#L34 assume true; 6730#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 7098#L35 assume true; 7044#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 7041#L36 assume true; 7034#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 7035#L18 assume !(0 == __VERIFIER_assert_~cond#1); 7039#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 7036#L36 assume true; 7017#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 6751#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6744#L35 assume true; 6745#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6736#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6737#L34 assume true; 6713#L34-2 [2024-11-17 08:34:20,490 INFO L747 eck$LassoCheckResult]: Loop: 6713#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 6712#L35 assume true; 6711#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6710#L36 assume true; 6709#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6708#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6707#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6706#L36 assume true; 6705#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6704#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6703#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6702#L36 assume true; 6701#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6698#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6700#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6699#L36 assume true; 6697#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 6696#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6695#L35 assume true; 6694#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6693#L36 assume true; 6692#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6691#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6690#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6689#L36 assume true; 6688#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6687#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6686#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6685#L36 assume true; 6684#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6683#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6682#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6681#L36 assume true; 6680#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6677#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6679#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6678#L36 assume true; 6676#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 6675#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6674#L35 assume true; 6673#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 6653#L36 assume true; 6672#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6671#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6670#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6669#L36 assume true; 6668#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6667#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6666#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6665#L36 assume true; 6664#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6663#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6662#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6661#L36 assume true; 6660#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 6657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 6659#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6658#L36 assume true; 6656#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 6655#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6654#L35 assume true; 6652#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 6642#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 6643#L34 assume true; 6713#L34-2 [2024-11-17 08:34:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1143148133, now seen corresponding path program 5 times [2024-11-17 08:34:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51192290] [2024-11-17 08:34:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:20,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:20,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:20,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -646239812, now seen corresponding path program 7 times [2024-11-17 08:34:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:20,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894835706] [2024-11-17 08:34:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 41 proven. 234 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-17 08:34:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894835706] [2024-11-17 08:34:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894835706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695636473] [2024-11-17 08:34:20,688 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:34:20,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:20,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:20,690 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:20,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-17 08:34:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:20,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:34:20,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 41 proven. 234 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-17 08:34:20,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 41 proven. 234 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-17 08:34:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695636473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:21,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2024-11-17 08:34:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826367419] [2024-11-17 08:34:21,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:21,036 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:34:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:34:21,037 INFO L87 Difference]: Start difference. First operand 562 states and 619 transitions. cyclomatic complexity: 65 Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:21,330 INFO L93 Difference]: Finished difference Result 858 states and 935 transitions. [2024-11-17 08:34:21,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 858 states and 935 transitions. [2024-11-17 08:34:21,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 101 [2024-11-17 08:34:21,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 858 states to 858 states and 935 transitions. [2024-11-17 08:34:21,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2024-11-17 08:34:21,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2024-11-17 08:34:21,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 858 states and 935 transitions. [2024-11-17 08:34:21,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:21,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 858 states and 935 transitions. [2024-11-17 08:34:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states and 935 transitions. [2024-11-17 08:34:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 725. [2024-11-17 08:34:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 725 states have (on average 1.096551724137931) internal successors, (795), 724 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 795 transitions. [2024-11-17 08:34:21,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 725 states and 795 transitions. [2024-11-17 08:34:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 08:34:21,351 INFO L425 stractBuchiCegarLoop]: Abstraction has 725 states and 795 transitions. [2024-11-17 08:34:21,352 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:34:21,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 725 states and 795 transitions. [2024-11-17 08:34:21,354 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2024-11-17 08:34:21,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:21,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:21,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:21,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 12, 12, 12, 4, 3, 3, 3, 1, 1, 1, 1] [2024-11-17 08:34:21,355 INFO L745 eck$LassoCheckResult]: Stem: 8461#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 8462#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 8474#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 8475#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 8463#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 8464#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 8465#L34 assume true; 8484#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 8591#L35 assume true; 8576#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 8577#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 8572#L34 assume true; 8470#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 8471#L35 assume true; 8494#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 8495#L36 assume true; 9155#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 9153#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9152#L36 assume true; 9143#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 9144#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9174#L35 assume true; 8923#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 8921#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 8920#L34 assume true; 8565#L34-2 [2024-11-17 08:34:21,356 INFO L747 eck$LassoCheckResult]: Loop: 8565#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 8564#L35 assume true; 8563#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 8562#L36 assume true; 8561#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8560#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8559#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8558#L36 assume true; 8557#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8556#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8555#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8554#L36 assume true; 8552#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8549#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8551#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8550#L36 assume true; 8548#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 8547#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8546#L35 assume true; 8545#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 8544#L36 assume true; 8543#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8542#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8541#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8540#L36 assume true; 8539#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8538#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8537#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8536#L36 assume true; 8535#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8534#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8533#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8532#L36 assume true; 8531#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8528#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8530#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8529#L36 assume true; 8527#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 8526#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8525#L35 assume true; 8524#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 8500#L36 assume true; 8523#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8522#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8521#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8520#L36 assume true; 8519#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8518#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8517#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8516#L36 assume true; 8515#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8514#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8513#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8512#L36 assume true; 8511#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8510#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8509#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8508#L36 assume true; 8507#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8504#L18 assume !(0 == __VERIFIER_assert_~cond#1); 8506#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8505#L36 assume true; 8503#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 8502#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8501#L35 assume true; 8499#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 8487#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 8488#L34 assume true; 8565#L34-2 [2024-11-17 08:34:21,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1143148133, now seen corresponding path program 6 times [2024-11-17 08:34:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346039837] [2024-11-17 08:34:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:21,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:21,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:21,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1615450140, now seen corresponding path program 8 times [2024-11-17 08:34:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810309001] [2024-11-17 08:34:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:21,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:21,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 549123198, now seen corresponding path program 7 times [2024-11-17 08:34:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429155390] [2024-11-17 08:34:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 303 proven. 81 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-17 08:34:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429155390] [2024-11-17 08:34:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429155390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060589388] [2024-11-17 08:34:21,537 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:34:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:21,539 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-17 08:34:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:21,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:34:21,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 220 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-17 08:34:21,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 220 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-17 08:34:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060589388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:21,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-11-17 08:34:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97848984] [2024-11-17 08:34:21,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:22,270 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:22,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:22,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:22,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:22,270 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:22,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:22,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:22,270 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration11_Loop [2024-11-17 08:34:22,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:22,271 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:22,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,330 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:22,330 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:22,333 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:22,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:34:22,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:22,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:22,351 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:22,351 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:22,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:22,369 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:22,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:34:22,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:22,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:22,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-17 08:34:22,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:22,401 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:22,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:22,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:22,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:34:22,414 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:22,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:34:22,425 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:22,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:22,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:22,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:22,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:22,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:22,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:22,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration11_Loop [2024-11-17 08:34:22,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:22,425 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:22,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:22,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:22,481 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:22,482 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:22,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:34:22,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:22,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:22,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:22,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:22,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:22,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:22,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:22,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:22,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:22,500 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:22,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:22,503 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:22,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-17 08:34:22,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:22,505 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:22,505 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:22,505 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2024-11-17 08:34:22,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-17 08:34:22,520 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:22,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:22,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:22,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:34:22,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-17 08:34:22,916 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2024-11-17 08:34:22,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 725 states and 795 transitions. cyclomatic complexity: 79 Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:23,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 725 states and 795 transitions. cyclomatic complexity: 79. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2476 states and 2679 transitions. Complement of second has 26 states. [2024-11-17 08:34:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2024-11-17 08:34:23,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 67 transitions. Stem has 26 letters. Loop has 68 letters. [2024-11-17 08:34:23,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:23,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 67 transitions. Stem has 94 letters. Loop has 68 letters. [2024-11-17 08:34:23,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:23,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 67 transitions. Stem has 26 letters. Loop has 136 letters. [2024-11-17 08:34:23,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:23,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2476 states and 2679 transitions. [2024-11-17 08:34:23,209 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 134 [2024-11-17 08:34:23,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2476 states to 1452 states and 1572 transitions. [2024-11-17 08:34:23,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2024-11-17 08:34:23,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2024-11-17 08:34:23,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1452 states and 1572 transitions. [2024-11-17 08:34:23,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:23,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1452 states and 1572 transitions. [2024-11-17 08:34:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states and 1572 transitions. [2024-11-17 08:34:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 982. [2024-11-17 08:34:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 982 states have (on average 1.0967413441955194) internal successors, (1077), 981 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1077 transitions. [2024-11-17 08:34:23,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 982 states and 1077 transitions. [2024-11-17 08:34:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 08:34:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-17 08:34:23,234 INFO L87 Difference]: Start difference. First operand 982 states and 1077 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:23,474 INFO L93 Difference]: Finished difference Result 1326 states and 1441 transitions. [2024-11-17 08:34:23,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 1441 transitions. [2024-11-17 08:34:23,481 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 105 [2024-11-17 08:34:23,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1221 states and 1333 transitions. [2024-11-17 08:34:23,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2024-11-17 08:34:23,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2024-11-17 08:34:23,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1221 states and 1333 transitions. [2024-11-17 08:34:23,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:23,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1221 states and 1333 transitions. [2024-11-17 08:34:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states and 1333 transitions. [2024-11-17 08:34:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1178. [2024-11-17 08:34:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1178 states have (on average 1.0933786078098473) internal successors, (1288), 1177 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1288 transitions. [2024-11-17 08:34:23,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1178 states and 1288 transitions. [2024-11-17 08:34:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 08:34:23,504 INFO L425 stractBuchiCegarLoop]: Abstraction has 1178 states and 1288 transitions. [2024-11-17 08:34:23,504 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:34:23,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1178 states and 1288 transitions. [2024-11-17 08:34:23,508 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 105 [2024-11-17 08:34:23,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:23,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:23,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:23,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:34:23,510 INFO L745 eck$LassoCheckResult]: Stem: 14910#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 14911#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 14923#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 14924#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 14912#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 14913#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 14914#L34 assume true; 14933#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 15188#L35 assume true; 15093#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 15092#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 15064#L34 assume true; 15062#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 15060#L35 assume true; 15058#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 15056#L36 assume true; 15054#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 15052#L18 assume !(0 == __VERIFIER_assert_~cond#1); 15050#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15048#L36 assume true; 15046#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 15045#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15044#L35 assume true; 15043#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 15042#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 15040#L34 assume true; 15039#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 15038#L35 assume true; 15037#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 15036#L36 assume true; 15035#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 15034#L18 assume !(0 == __VERIFIER_assert_~cond#1); 15033#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15032#L36 assume true; 15031#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 14929#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14930#L35 assume true; 14940#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 14915#L36 [2024-11-17 08:34:23,510 INFO L747 eck$LassoCheckResult]: Loop: 14915#L36 assume true; 14916#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 14925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 14926#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 14915#L36 [2024-11-17 08:34:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1518244530, now seen corresponding path program 8 times [2024-11-17 08:34:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393581192] [2024-11-17 08:34:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:23,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-17 08:34:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:34:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393581192] [2024-11-17 08:34:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393581192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631744290] [2024-11-17 08:34:23,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:34:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:23,632 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:23,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-17 08:34:23,678 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:34:23,679 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:23,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:34:23,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:34:23,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:34:23,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631744290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:23,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-17 08:34:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53997095] [2024-11-17 08:34:23,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:23,838 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:34:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1445721, now seen corresponding path program 1 times [2024-11-17 08:34:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991636052] [2024-11-17 08:34:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:23,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:23,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:23,875 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:23,875 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:23,875 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:23,875 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:23,875 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:23,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:23,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:23,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:23,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration12_Loop [2024-11-17 08:34:23,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:23,876 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:23,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:23,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:23,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:23,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:23,910 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:23,910 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:23,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:23,912 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:23,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-17 08:34:23,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:23,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:23,930 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:23,931 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:23,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:23,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:23,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:23,947 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:23,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:34:23,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:23,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:23,965 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:23,965 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:23,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:23,983 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:23,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:34:23,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:23,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:24,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:24,021 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:24,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:34:24,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:24,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:24,169 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:24,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:24,174 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:24,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:24,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:24,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:24,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:24,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:24,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:24,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:24,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration12_Loop [2024-11-17 08:34:24,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:24,174 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:24,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:24,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:24,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:24,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:24,203 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:24,203 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:24,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:24,204 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:24,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:34:24,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:24,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:24,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:24,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:24,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:24,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:24,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:24,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:24,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:24,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:34:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:24,230 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:24,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-17 08:34:24,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:24,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:24,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:24,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:24,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:24,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:24,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:24,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:24,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:24,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-17 08:34:24,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:24,255 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:24,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-17 08:34:24,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:24,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:24,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:24,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:24,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:24,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:24,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:24,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:24,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:24,272 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:34:24,272 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:34:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:24,274 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:24,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-17 08:34:24,276 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:24,276 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:24,276 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:24,276 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~j~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2024-11-17 08:34:24,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-17 08:34:24,289 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:24,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:24,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:24,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:24,384 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:34:24,384 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1178 states and 1288 transitions. cyclomatic complexity: 128 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,402 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1178 states and 1288 transitions. cyclomatic complexity: 128. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1206 states and 1318 transitions. Complement of second has 7 states. [2024-11-17 08:34:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-17 08:34:24,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 38 letters. Loop has 4 letters. [2024-11-17 08:34:24,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:24,403 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:24,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:24,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:24,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:24,489 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:34:24,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1178 states and 1288 transitions. cyclomatic complexity: 128 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,506 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1178 states and 1288 transitions. cyclomatic complexity: 128. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1206 states and 1318 transitions. Complement of second has 7 states. [2024-11-17 08:34:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-17 08:34:24,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 38 letters. Loop has 4 letters. [2024-11-17 08:34:24,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:24,508 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:24,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:24,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:24,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:24,596 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:34:24,596 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1178 states and 1288 transitions. cyclomatic complexity: 128 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1178 states and 1288 transitions. cyclomatic complexity: 128. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1818 states and 1976 transitions. Complement of second has 6 states. [2024-11-17 08:34:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-17 08:34:24,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 38 letters. Loop has 4 letters. [2024-11-17 08:34:24,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:24,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 42 letters. Loop has 4 letters. [2024-11-17 08:34:24,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:24,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 38 letters. Loop has 8 letters. [2024-11-17 08:34:24,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:24,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1818 states and 1976 transitions. [2024-11-17 08:34:24,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 101 [2024-11-17 08:34:24,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1818 states to 1218 states and 1326 transitions. [2024-11-17 08:34:24,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-17 08:34:24,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-11-17 08:34:24,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1218 states and 1326 transitions. [2024-11-17 08:34:24,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:24,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1218 states and 1326 transitions. [2024-11-17 08:34:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 1326 transitions. [2024-11-17 08:34:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1170. [2024-11-17 08:34:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1170 states have (on average 1.0923076923076922) internal successors, (1278), 1169 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1278 transitions. [2024-11-17 08:34:24,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1278 transitions. [2024-11-17 08:34:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 08:34:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-17 08:34:24,660 INFO L87 Difference]: Start difference. First operand 1170 states and 1278 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:24,762 INFO L93 Difference]: Finished difference Result 1097 states and 1180 transitions. [2024-11-17 08:34:24,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1097 states and 1180 transitions. [2024-11-17 08:34:24,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97 [2024-11-17 08:34:24,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1097 states to 808 states and 869 transitions. [2024-11-17 08:34:24,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-17 08:34:24,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-17 08:34:24,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 808 states and 869 transitions. [2024-11-17 08:34:24,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:24,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 808 states and 869 transitions. [2024-11-17 08:34:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states and 869 transitions. [2024-11-17 08:34:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 785. [2024-11-17 08:34:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 785 states have (on average 1.0777070063694267) internal successors, (846), 784 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 846 transitions. [2024-11-17 08:34:24,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 785 states and 846 transitions. [2024-11-17 08:34:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:34:24,780 INFO L425 stractBuchiCegarLoop]: Abstraction has 785 states and 846 transitions. [2024-11-17 08:34:24,780 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:34:24,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 785 states and 846 transitions. [2024-11-17 08:34:24,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97 [2024-11-17 08:34:24,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:24,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:24,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:24,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 13, 13, 13, 4, 3, 3, 3, 1, 1, 1, 1] [2024-11-17 08:34:24,784 INFO L745 eck$LassoCheckResult]: Stem: 23239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 23240#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 23252#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 23253#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 23241#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 23242#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 23243#L34 assume true; 23260#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23403#L35 assume true; 23402#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23401#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23370#L34 assume true; 23372#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23786#L35 assume true; 23785#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23784#L36 assume true; 23783#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23782#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23781#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23652#L36 assume true; 23653#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 23824#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23823#L35 assume true; 23411#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23264#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23261#L34 assume true; 23250#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23251#L35 assume true; 23974#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23973#L36 assume true; 23972#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23971#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23970#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23969#L36 assume true; 23968#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23967#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23966#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23964#L36 assume true; 23965#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 23256#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23257#L35 assume true; 23268#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23269#L36 assume true; 24023#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 24021#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23989#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23988#L36 assume true; 23986#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23987#L18 assume !(0 == __VERIFIER_assert_~cond#1); 24010#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 24008#L36 assume true; 24002#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 24006#L18 assume !(0 == __VERIFIER_assert_~cond#1); 24004#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 24001#L36 assume true; 23999#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 23997#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23995#L35 assume true; 23906#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23905#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23904#L34 assume true; 23345#L34-2 [2024-11-17 08:34:24,784 INFO L747 eck$LassoCheckResult]: Loop: 23345#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23344#L35 assume true; 23343#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23342#L36 assume true; 23341#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23339#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23338#L36 assume true; 23337#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23336#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23335#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23333#L36 assume true; 23332#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23331#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23330#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23328#L36 assume true; 23325#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23327#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23326#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23324#L36 assume true; 23323#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 23322#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23321#L35 assume true; 23320#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23319#L36 assume true; 23318#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23316#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23315#L36 assume true; 23314#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23312#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23311#L36 assume true; 23310#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23308#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23307#L36 assume true; 23304#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23306#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23305#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23303#L36 assume true; 23302#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 23301#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23300#L35 assume true; 23299#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23275#L36 assume true; 23298#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23297#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23296#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23295#L36 assume true; 23294#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23292#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23291#L36 assume true; 23290#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23289#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23288#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23287#L36 assume true; 23286#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23285#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23284#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23283#L36 assume true; 23280#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23282#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23281#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23279#L36 assume true; 23278#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 23277#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23276#L35 assume true; 23274#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23262#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23263#L34 assume true; 23345#L34-2 [2024-11-17 08:34:24,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash -247643808, now seen corresponding path program 9 times [2024-11-17 08:34:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747623702] [2024-11-17 08:34:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:24,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:24,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:24,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 882642956, now seen corresponding path program 9 times [2024-11-17 08:34:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:24,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256507771] [2024-11-17 08:34:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:24,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-17 08:34:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 230 proven. 128 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-17 08:34:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256507771] [2024-11-17 08:34:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256507771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439469207] [2024-11-17 08:34:25,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:34:25,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:25,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:25,052 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:25,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-17 08:34:25,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-17 08:34:25,126 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:25,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 08:34:25,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 146 proven. 212 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-17 08:34:25,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 100 proven. 258 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-17 08:34:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439469207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:25,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2024-11-17 08:34:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595974964] [2024-11-17 08:34:25,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:25,873 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-17 08:34:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1310, Unknown=0, NotChecked=0, Total=1560 [2024-11-17 08:34:25,874 INFO L87 Difference]: Start difference. First operand 785 states and 846 transitions. cyclomatic complexity: 71 Second operand has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:27,820 INFO L93 Difference]: Finished difference Result 2395 states and 2589 transitions. [2024-11-17 08:34:27,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2395 states and 2589 transitions. [2024-11-17 08:34:27,829 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 274 [2024-11-17 08:34:27,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2395 states to 1242 states and 1331 transitions. [2024-11-17 08:34:27,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-11-17 08:34:27,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2024-11-17 08:34:27,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1242 states and 1331 transitions. [2024-11-17 08:34:27,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:27,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1242 states and 1331 transitions. [2024-11-17 08:34:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states and 1331 transitions. [2024-11-17 08:34:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 776. [2024-11-17 08:34:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 776 states have (on average 1.0721649484536082) internal successors, (832), 775 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 832 transitions. [2024-11-17 08:34:27,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 776 states and 832 transitions. [2024-11-17 08:34:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-17 08:34:27,847 INFO L425 stractBuchiCegarLoop]: Abstraction has 776 states and 832 transitions. [2024-11-17 08:34:27,847 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:34:27,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 776 states and 832 transitions. [2024-11-17 08:34:27,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2024-11-17 08:34:27,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:27,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:27,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:27,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 17, 17, 17, 4, 3, 3, 3, 1, 1, 1, 1] [2024-11-17 08:34:27,851 INFO L745 eck$LassoCheckResult]: Stem: 27043#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 27044#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 27055#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 27056#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 27045#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 27046#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 27047#L34 assume true; 27179#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27178#L35 assume true; 27177#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27176#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27174#L34 assume true; 27173#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27172#L35 assume true; 27171#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27170#L36 assume true; 27169#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27168#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27167#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27166#L36 assume true; 27165#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 27164#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27163#L35 assume true; 27162#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27161#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27160#L34 assume true; 27159#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27158#L35 assume true; 27157#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27156#L36 assume true; 27155#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27153#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27152#L36 assume true; 27151#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27149#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27148#L36 assume true; 27146#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 27144#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27142#L35 assume true; 27140#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27136#L36 assume true; 27137#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27132#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27133#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27128#L36 assume true; 27129#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27124#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27125#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27120#L36 assume true; 27121#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27116#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27117#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27112#L36 assume true; 27113#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27108#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27109#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27104#L36 assume true; 27105#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27100#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27101#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27096#L36 assume true; 27086#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27090#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27091#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27085#L36 assume true; 27087#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 27081#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27082#L35 assume true; 27078#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27066#L34-1 [2024-11-17 08:34:27,851 INFO L747 eck$LassoCheckResult]: Loop: 27066#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 27063#L34 assume true; 27064#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 27254#L35 assume true; 27255#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27250#L36 assume true; 27251#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27246#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27247#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27242#L36 assume true; 27243#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27238#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27239#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27234#L36 assume true; 27235#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27786#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27785#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27229#L36 assume true; 27226#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27228#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27227#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27225#L36 assume true; 27182#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 27221#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27220#L35 assume true; 27219#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27218#L36 assume true; 27217#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27216#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27215#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27214#L36 assume true; 27213#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27211#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27210#L36 assume true; 27209#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27208#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27207#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27206#L36 assume true; 27205#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27204#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27203#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27202#L36 assume true; 27201#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27200#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27199#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27198#L36 assume true; 27188#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27189#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27187#L36 assume true; 27181#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 27183#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27180#L35 assume true; 27147#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 27145#L36 assume true; 27143#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27141#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27138#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27139#L36 assume true; 27134#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27135#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27130#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27131#L36 assume true; 27126#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27127#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27122#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27123#L36 assume true; 27118#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27119#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27114#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27115#L36 assume true; 27110#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27111#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27106#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27107#L36 assume true; 27102#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27103#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27098#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27099#L36 assume true; 27092#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 27093#L18 assume !(0 == __VERIFIER_assert_~cond#1); 27088#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 27089#L36 assume true; 27083#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 27084#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27079#L35 assume true; 27080#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 27066#L34-1 [2024-11-17 08:34:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash 908902622, now seen corresponding path program 10 times [2024-11-17 08:34:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762397288] [2024-11-17 08:34:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 100 proven. 132 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:34:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762397288] [2024-11-17 08:34:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762397288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:28,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891156263] [2024-11-17 08:34:28,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:34:28,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:28,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:28,031 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:28,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-17 08:34:28,088 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:34:28,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:28,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:28,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 120 proven. 100 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 08:34:28,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 120 proven. 100 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 08:34:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891156263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:28,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 20 [2024-11-17 08:34:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377933255] [2024-11-17 08:34:28,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:28,383 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:34:28,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1343662284, now seen corresponding path program 10 times [2024-11-17 08:34:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:28,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941020236] [2024-11-17 08:34:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 18 proven. 479 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-17 08:34:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941020236] [2024-11-17 08:34:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941020236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694613908] [2024-11-17 08:34:28,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:34:28,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:28,551 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:28,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-17 08:34:28,618 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:34:28,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:28,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:34:28,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 404 proven. 132 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-17 08:34:28,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 404 proven. 132 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-17 08:34:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694613908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:29,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 24 [2024-11-17 08:34:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106362567] [2024-11-17 08:34:29,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:29,048 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 08:34:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-17 08:34:29,049 INFO L87 Difference]: Start difference. First operand 776 states and 832 transitions. cyclomatic complexity: 65 Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:29,219 INFO L93 Difference]: Finished difference Result 756 states and 806 transitions. [2024-11-17 08:34:29,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 756 states and 806 transitions. [2024-11-17 08:34:29,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2024-11-17 08:34:29,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 756 states to 754 states and 804 transitions. [2024-11-17 08:34:29,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-17 08:34:29,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-17 08:34:29,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 804 transitions. [2024-11-17 08:34:29,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:29,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 804 transitions. [2024-11-17 08:34:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 804 transitions. [2024-11-17 08:34:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2024-11-17 08:34:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 752 states have (on average 1.0664893617021276) internal successors, (802), 751 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 802 transitions. [2024-11-17 08:34:29,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 752 states and 802 transitions. [2024-11-17 08:34:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 08:34:29,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 752 states and 802 transitions. [2024-11-17 08:34:29,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-17 08:34:29,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 752 states and 802 transitions. [2024-11-17 08:34:29,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2024-11-17 08:34:29,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:29,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:29,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 10, 10, 10, 7, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:29,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1, 1] [2024-11-17 08:34:29,245 INFO L745 eck$LassoCheckResult]: Stem: 29586#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 29587#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 29599#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 29600#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 29588#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 29589#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 29590#L34 assume true; 29607#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 29802#L35 assume true; 29801#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 29800#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 29782#L34 assume true; 29783#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30015#L35 assume true; 30016#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 29978#L36 assume true; 29979#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29974#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29975#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29970#L36 assume true; 29971#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 29966#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 29967#L35 assume true; 29960#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 29961#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 29608#L34 assume true; 29609#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 30186#L35 assume true; 30184#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30182#L36 assume true; 30180#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30178#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30176#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30174#L36 assume true; 30172#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30171#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30170#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30168#L36 assume true; 30167#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 30166#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30164#L35 assume true; 30162#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 30160#L36 assume true; 30158#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30156#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30154#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30152#L36 assume true; 30150#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30148#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30146#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30144#L36 assume true; 30142#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 30140#L18 assume !(0 == __VERIFIER_assert_~cond#1); 30138#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 30136#L36 assume true; 30128#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 30129#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 30225#L35 assume true; 29807#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 29736#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 29737#L34 assume true; 29730#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 29731#L35 assume true; 29726#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 29727#L36 assume true; 29722#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29723#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29718#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29719#L36 assume true; 29714#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29715#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29710#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29711#L36 assume true; 29742#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29744#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29704#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29705#L36 assume true; 29700#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29702#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29701#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29699#L36 assume true; 29648#L36-1 [2024-11-17 08:34:29,245 INFO L747 eck$LassoCheckResult]: Loop: 29648#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 29698#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 29697#L35 assume true; 29696#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 29695#L36 assume true; 29694#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29693#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29692#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29691#L36 assume true; 29690#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29689#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29688#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29687#L36 assume true; 29686#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29685#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29684#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29683#L36 assume true; 29682#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29681#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29680#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29679#L36 assume true; 29678#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29677#L18 assume !(0 == __VERIFIER_assert_~cond#1); 29676#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 29675#L36 assume true; 29648#L36-1 [2024-11-17 08:34:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 903581558, now seen corresponding path program 11 times [2024-11-17 08:34:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179700678] [2024-11-17 08:34:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 49 proven. 197 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-17 08:34:29,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179700678] [2024-11-17 08:34:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179700678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140118141] [2024-11-17 08:34:29,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:34:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:29,390 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:29,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-17 08:34:29,463 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-17 08:34:29,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:29,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:29,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 49 proven. 197 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-17 08:34:29,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 49 proven. 197 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-17 08:34:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140118141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:29,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-11-17 08:34:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952284069] [2024-11-17 08:34:29,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:29,743 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:34:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 846420739, now seen corresponding path program 1 times [2024-11-17 08:34:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919473661] [2024-11-17 08:34:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:29,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:29,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:29,954 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:29,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:29,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:29,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:29,954 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:29,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:29,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:29,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:29,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration15_Loop [2024-11-17 08:34:29,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:29,955 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:29,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,015 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:30,015 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:30,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,022 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:30,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-17 08:34:30,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:30,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:30,039 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:30,039 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:30,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:30,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,056 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:30,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-17 08:34:30,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:30,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:30,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-17 08:34:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,089 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:30,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-17 08:34:30,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:30,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:30,388 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:30,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-17 08:34:30,394 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:30,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:30,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:30,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:30,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:30,395 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,395 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:30,395 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:30,395 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration15_Loop [2024-11-17 08:34:30,395 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:30,395 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:30,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,450 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:30,451 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:30,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,452 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:30,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-17 08:34:30,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:30,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:30,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:30,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:30,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:30,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:30,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:30,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:30,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:30,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:30,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,479 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:30,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-17 08:34:30,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:30,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:30,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:30,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:30,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:30,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:30,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:30,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:30,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:30,502 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:34:30,503 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:34:30,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,506 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:30,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-17 08:34:30,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:30,507 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:30,508 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:30,508 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-17 08:34:30,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:30,522 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:30,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 08:34:30,716 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:34:30,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 752 states and 802 transitions. cyclomatic complexity: 58 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,734 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 752 states and 802 transitions. cyclomatic complexity: 58. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 766 states and 816 transitions. Complement of second has 7 states. [2024-11-17 08:34:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-17 08:34:30,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 81 letters. Loop has 25 letters. [2024-11-17 08:34:30,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,735 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:30,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 08:34:30,947 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:34:30,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 752 states and 802 transitions. cyclomatic complexity: 58 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 752 states and 802 transitions. cyclomatic complexity: 58. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 766 states and 816 transitions. Complement of second has 7 states. [2024-11-17 08:34:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-17 08:34:30,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 81 letters. Loop has 25 letters. [2024-11-17 08:34:30,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,960 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 08:34:31,166 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:34:31,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 752 states and 802 transitions. cyclomatic complexity: 58 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 752 states and 802 transitions. cyclomatic complexity: 58. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1393 states and 1471 transitions. Complement of second has 9 states. [2024-11-17 08:34:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-17 08:34:31,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 81 letters. Loop has 25 letters. [2024-11-17 08:34:31,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:31,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 106 letters. Loop has 25 letters. [2024-11-17 08:34:31,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:31,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 81 letters. Loop has 50 letters. [2024-11-17 08:34:31,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:31,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1393 states and 1471 transitions. [2024-11-17 08:34:31,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2024-11-17 08:34:31,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1393 states to 978 states and 1034 transitions. [2024-11-17 08:34:31,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:34:31,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-17 08:34:31,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 978 states and 1034 transitions. [2024-11-17 08:34:31,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:31,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 978 states and 1034 transitions. [2024-11-17 08:34:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states and 1034 transitions. [2024-11-17 08:34:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 771. [2024-11-17 08:34:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 771 states have (on average 1.0583657587548638) internal successors, (816), 770 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 816 transitions. [2024-11-17 08:34:31,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 771 states and 816 transitions. [2024-11-17 08:34:31,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 08:34:31,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-17 08:34:31,213 INFO L87 Difference]: Start difference. First operand 771 states and 816 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:31,484 INFO L93 Difference]: Finished difference Result 1517 states and 1599 transitions. [2024-11-17 08:34:31,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1517 states and 1599 transitions. [2024-11-17 08:34:31,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2024-11-17 08:34:31,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1517 states to 1443 states and 1522 transitions. [2024-11-17 08:34:31,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-17 08:34:31,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-17 08:34:31,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1443 states and 1522 transitions. [2024-11-17 08:34:31,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:31,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1443 states and 1522 transitions. [2024-11-17 08:34:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states and 1522 transitions. [2024-11-17 08:34:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 802. [2024-11-17 08:34:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 802 states have (on average 1.0586034912718205) internal successors, (849), 801 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 849 transitions. [2024-11-17 08:34:31,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 802 states and 849 transitions. [2024-11-17 08:34:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 08:34:31,515 INFO L425 stractBuchiCegarLoop]: Abstraction has 802 states and 849 transitions. [2024-11-17 08:34:31,515 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-17 08:34:31,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 802 states and 849 transitions. [2024-11-17 08:34:31,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2024-11-17 08:34:31,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:31,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:31,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-17 08:34:31,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 11, 11, 11, 9, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:31,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 17, 17, 17, 4, 3, 3, 3, 1, 1, 1, 1] [2024-11-17 08:34:31,521 INFO L745 eck$LassoCheckResult]: Stem: 37078#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 37079#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 37091#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 37092#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 37080#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 37081#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 37082#L34 assume true; 37099#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37157#L35 assume true; 37156#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37155#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37138#L34 assume true; 37139#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37461#L35 assume true; 37460#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37459#L36 assume true; 37458#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37456#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37455#L36 assume true; 37454#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37453#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37452#L35 assume true; 37451#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37450#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37100#L34 assume true; 37101#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37572#L35 assume true; 37571#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37570#L36 assume true; 37569#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37567#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37566#L36 assume true; 37565#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37564#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37563#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37562#L36 assume true; 37561#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37560#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37559#L35 assume true; 37558#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37557#L36 assume true; 37556#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37555#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37554#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37553#L36 assume true; 37552#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37551#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37550#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37549#L36 assume true; 37548#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37547#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37546#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37545#L36 assume true; 37544#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37543#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37542#L35 assume true; 37541#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37104#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37105#L34 assume true; 37447#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37445#L35 assume true; 37443#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37441#L36 assume true; 37439#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37437#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37435#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37433#L36 assume true; 37430#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37428#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37426#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37423#L36 assume true; 37421#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37418#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37416#L35 assume true; 37414#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37411#L36 assume true; 37409#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37407#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37405#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37403#L36 assume true; 37401#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37399#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37397#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37395#L36 assume true; 37393#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37390#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37211#L36 assume true; 37213#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37163#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37164#L35 assume true; 37464#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37141#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37142#L34 assume true; 37114#L34-2 [2024-11-17 08:34:31,521 INFO L747 eck$LassoCheckResult]: Loop: 37114#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 37113#L35 assume true; 37112#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37083#L36 assume true; 37084#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37135#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37134#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37133#L36 assume true; 37132#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37131#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37130#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37129#L36 assume true; 37128#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37127#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37126#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37125#L36 assume true; 37122#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37124#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37123#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37121#L36 assume true; 37109#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37110#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37691#L35 assume true; 37690#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37689#L36 assume true; 37243#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37687#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37685#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37683#L36 assume true; 37681#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37679#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37677#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37675#L36 assume true; 37673#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37671#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37669#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37667#L36 assume true; 37665#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37663#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37660#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37657#L36 assume true; 37655#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37652#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37649#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37252#L36 assume true; 37249#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37251#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37250#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37248#L36 assume true; 37247#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37246#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37245#L35 assume true; 37244#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 37242#L36 assume true; 37241#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37240#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37239#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37238#L36 assume true; 37237#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37236#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37235#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37234#L36 assume true; 37233#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37232#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37231#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37230#L36 assume true; 37229#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37228#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37227#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37226#L36 assume true; 37225#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37224#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37223#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37222#L36 assume true; 37221#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37219#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37137#L36 assume true; 37119#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 37136#L18 assume !(0 == __VERIFIER_assert_~cond#1); 37120#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 37118#L36 assume true; 37117#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 37095#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 37096#L35 assume true; 37106#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 37102#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37103#L34 assume true; 37114#L34-2 [2024-11-17 08:34:31,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1226247301, now seen corresponding path program 12 times [2024-11-17 08:34:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781561561] [2024-11-17 08:34:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 244 proven. 116 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-17 08:34:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:31,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781561561] [2024-11-17 08:34:31,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781561561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:31,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122848309] [2024-11-17 08:34:31,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:34:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:31,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:31,688 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:31,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-11-17 08:34:31,764 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-17 08:34:31,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:31,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 263 proven. 109 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-17 08:34:31,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 165 proven. 207 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-17 08:34:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122848309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:32,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-11-17 08:34:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057262210] [2024-11-17 08:34:32,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:32,129 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:34:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1170669556, now seen corresponding path program 11 times [2024-11-17 08:34:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543685246] [2024-11-17 08:34:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 18 proven. 479 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-17 08:34:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543685246] [2024-11-17 08:34:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543685246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881676874] [2024-11-17 08:34:32,308 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:34:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:32,310 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:32,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-17 08:34:32,389 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-17 08:34:32,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:32,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:34:32,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 404 proven. 132 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-17 08:34:32,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 404 proven. 132 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-17 08:34:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881676874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:32,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 24 [2024-11-17 08:34:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144263594] [2024-11-17 08:34:32,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:32,736 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 08:34:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-11-17 08:34:32,737 INFO L87 Difference]: Start difference. First operand 802 states and 849 transitions. cyclomatic complexity: 53 Second operand has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:33,531 INFO L93 Difference]: Finished difference Result 1278 states and 1339 transitions. [2024-11-17 08:34:33,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1278 states and 1339 transitions. [2024-11-17 08:34:33,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2024-11-17 08:34:33,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1278 states to 1242 states and 1300 transitions. [2024-11-17 08:34:33,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:34:33,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:34:33,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1242 states and 1300 transitions. [2024-11-17 08:34:33,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:33,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1242 states and 1300 transitions. [2024-11-17 08:34:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states and 1300 transitions. [2024-11-17 08:34:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 945. [2024-11-17 08:34:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 945 states have (on average 1.053968253968254) internal successors, (996), 944 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 996 transitions. [2024-11-17 08:34:33,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 945 states and 996 transitions. [2024-11-17 08:34:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-17 08:34:33,551 INFO L425 stractBuchiCegarLoop]: Abstraction has 945 states and 996 transitions. [2024-11-17 08:34:33,551 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-17 08:34:33,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 996 transitions. [2024-11-17 08:34:33,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2024-11-17 08:34:33,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:33,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:33,555 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 11, 11, 11, 9, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:33,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 22, 22, 22, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-17 08:34:33,556 INFO L745 eck$LassoCheckResult]: Stem: 40402#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 40403#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 40415#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 40416#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 40404#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 40405#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 40406#L34 assume true; 40423#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 40503#L35 assume true; 40502#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 40501#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 40474#L34 assume true; 40475#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 40758#L35 assume true; 40756#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40757#L36 assume true; 40793#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40792#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40791#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40790#L36 assume true; 40789#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 40788#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40787#L35 assume true; 40786#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 40785#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 40784#L34 assume true; 40783#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 40782#L35 assume true; 40781#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40780#L36 assume true; 40779#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40778#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40777#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40776#L36 assume true; 40775#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40774#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40773#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40772#L36 assume true; 40771#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 40770#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40769#L35 assume true; 40767#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40768#L36 assume true; 41065#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41064#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41063#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41062#L36 assume true; 41061#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41060#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41059#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41058#L36 assume true; 41057#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41056#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41055#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41054#L36 assume true; 41053#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 41052#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40736#L35 assume true; 40737#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 40428#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 40429#L34 assume true; 40425#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 40960#L35 assume true; 40959#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40958#L36 assume true; 40957#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40956#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40955#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40954#L36 assume true; 40953#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40952#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40951#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40949#L36 assume true; 40950#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 41207#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 41206#L35 assume true; 41205#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 41203#L36 assume true; 41204#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41303#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41302#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41301#L36 assume true; 41300#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41299#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41298#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41265#L36 assume true; 41264#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41263#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41266#L36 assume true; 41162#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 40557#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40553#L35 assume true; 40554#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 40472#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 40473#L34 assume true; 40440#L34-2 [2024-11-17 08:34:33,556 INFO L747 eck$LassoCheckResult]: Loop: 40440#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 40436#L35 assume true; 40437#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40407#L36 assume true; 40408#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40469#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40468#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40467#L36 assume true; 40466#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40465#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40464#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40463#L36 assume true; 40462#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40461#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40460#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40458#L36 assume true; 40459#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41346#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41345#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41344#L36 assume true; 41343#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 41342#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 41341#L35 assume true; 41340#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 41339#L36 assume true; 40435#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40417#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40418#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40430#L36 assume true; 41335#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41333#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41331#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41329#L36 assume true; 41327#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41325#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41323#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41321#L36 assume true; 41319#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41317#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41315#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41313#L36 assume true; 41312#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41311#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41310#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41304#L36 assume true; 40546#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 40421#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40422#L35 assume true; 41157#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 41155#L36 assume true; 40536#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 41153#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 41152#L36 assume true; 41151#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 41150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40922#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40919#L36 assume true; 40916#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40913#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40744#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40604#L36 assume true; 40602#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40600#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40598#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40596#L36 assume true; 40594#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40556#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40552#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40545#L36 assume true; 40542#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40544#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40543#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40541#L36 assume true; 40540#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 40539#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40538#L35 assume true; 40537#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 40535#L36 assume true; 40534#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40533#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40530#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40528#L36 assume true; 40529#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40524#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40525#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40520#L36 assume true; 40521#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40516#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40517#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40512#L36 assume true; 40513#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40504#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40505#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40491#L36 assume true; 40492#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40483#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40484#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40470#L36 assume true; 40471#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40454#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40455#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40447#L36 assume true; 40442#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40446#L18 assume !(0 == __VERIFIER_assert_~cond#1); 40445#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 40441#L36 assume true; 40439#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 40419#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 40420#L35 assume true; 40431#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 40426#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 40427#L34 assume true; 40440#L34-2 [2024-11-17 08:34:33,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1226247301, now seen corresponding path program 13 times [2024-11-17 08:34:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:33,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900135204] [2024-11-17 08:34:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 244 proven. 116 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-17 08:34:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900135204] [2024-11-17 08:34:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900135204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317435450] [2024-11-17 08:34:33,687 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:34:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:33,690 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:33,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-11-17 08:34:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:33,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:34:33,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 274 proven. 86 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-17 08:34:33,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 262 proven. 98 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-17 08:34:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317435450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:34,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2024-11-17 08:34:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208319374] [2024-11-17 08:34:34,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:34,052 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:34:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -436396638, now seen corresponding path program 12 times [2024-11-17 08:34:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196237221] [2024-11-17 08:34:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:34,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:34,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:35,412 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:35,412 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:35,412 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:35,412 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:35,412 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:35,412 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,412 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:35,412 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:35,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration17_Loop [2024-11-17 08:34:35,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:35,413 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:35,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,466 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:35,466 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,469 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-17 08:34:35,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,488 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,488 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-17 08:34:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,501 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-17 08:34:35,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,514 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,514 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-17 08:34:35,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,526 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-17 08:34:35,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,538 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,538 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,551 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-17 08:34:35,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,564 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,564 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-17 08:34:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,580 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-17 08:34:35,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,592 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,592 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,604 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-17 08:34:35,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,624 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,624 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=5} Honda state: {ULTIMATE.start_main_~n~0#1=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,637 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-17 08:34:35,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,650 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,650 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,667 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-17 08:34:35,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,680 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:35,680 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:35,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,693 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-17 08:34:35,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:35,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-17 08:34:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,717 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-17 08:34:35,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:35,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:35,733 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:35,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-17 08:34:35,745 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:35,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:35,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:35,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:35,745 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:35,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,746 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:35,746 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:35,746 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration17_Loop [2024-11-17 08:34:35,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:35,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:35,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:35,795 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:35,795 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,797 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-17 08:34:35,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-17 08:34:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,821 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-17 08:34:35,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-17 08:34:35,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,845 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-17 08:34:35,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,870 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-17 08:34:35,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,895 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-17 08:34:35,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:35,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,920 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-17 08:34:35,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-17 08:34:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,945 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-17 08:34:35,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-17 08:34:35,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,970 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-17 08:34:35,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:35,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:35,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:35,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:35,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:35,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:35,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:35,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:35,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:35,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-17 08:34:35,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:35,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:35,995 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:35,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-17 08:34:35,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:36,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:36,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:36,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:36,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:36,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:36,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:36,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:36,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:36,012 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:36,012 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:36,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:36,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:36,014 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:36,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-17 08:34:36,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:36,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:36,016 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:36,016 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-11-17 08:34:36,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-17 08:34:36,028 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:36,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:36,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:36,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:36,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:36,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-17 08:34:36,688 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-17 08:34:36,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 945 states and 996 transitions. cyclomatic complexity: 57 Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:36,990 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 945 states and 996 transitions. cyclomatic complexity: 57. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2037 states and 2148 transitions. Complement of second has 30 states. [2024-11-17 08:34:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2024-11-17 08:34:36,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 96 letters. Loop has 113 letters. [2024-11-17 08:34:36,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:36,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 209 letters. Loop has 113 letters. [2024-11-17 08:34:36,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:36,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 96 letters. Loop has 226 letters. [2024-11-17 08:34:36,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:36,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2037 states and 2148 transitions. [2024-11-17 08:34:36,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2024-11-17 08:34:37,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2037 states to 1157 states and 1224 transitions. [2024-11-17 08:34:37,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:34:37,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-17 08:34:37,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1157 states and 1224 transitions. [2024-11-17 08:34:37,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:37,003 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1157 states and 1224 transitions. [2024-11-17 08:34:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states and 1224 transitions. [2024-11-17 08:34:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1136. [2024-11-17 08:34:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1136 states have (on average 1.0589788732394365) internal successors, (1203), 1135 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1203 transitions. [2024-11-17 08:34:37,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1136 states and 1203 transitions. [2024-11-17 08:34:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 08:34:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-17 08:34:37,015 INFO L87 Difference]: Start difference. First operand 1136 states and 1203 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:37,181 INFO L93 Difference]: Finished difference Result 859 states and 901 transitions. [2024-11-17 08:34:37,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 901 transitions. [2024-11-17 08:34:37,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2024-11-17 08:34:37,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 675 states and 709 transitions. [2024-11-17 08:34:37,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:34:37,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:34:37,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 709 transitions. [2024-11-17 08:34:37,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:37,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 709 transitions. [2024-11-17 08:34:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 709 transitions. [2024-11-17 08:34:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2024-11-17 08:34:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 675 states have (on average 1.0503703703703704) internal successors, (709), 674 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 709 transitions. [2024-11-17 08:34:37,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 709 transitions. [2024-11-17 08:34:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 08:34:37,194 INFO L425 stractBuchiCegarLoop]: Abstraction has 675 states and 709 transitions. [2024-11-17 08:34:37,194 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-17 08:34:37,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 675 states and 709 transitions. [2024-11-17 08:34:37,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2024-11-17 08:34:37,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:37,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:37,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 18, 18, 18, 10, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:37,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [27, 23, 23, 23, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-17 08:34:37,197 INFO L745 eck$LassoCheckResult]: Stem: 46670#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 46671#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 46682#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 46683#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 46672#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 46673#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 46674#L34 assume true; 46690#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46978#L35 assume true; 46821#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46817#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46818#L34 assume true; 46975#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 47141#L35 assume true; 47139#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47137#L36 assume true; 47135#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47133#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47131#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47129#L36 assume true; 47127#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 46986#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46984#L35 assume true; 46980#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46981#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 47119#L34 assume true; 47117#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 47115#L35 assume true; 47114#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47113#L36 assume true; 47112#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47110#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47108#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47106#L36 assume true; 47104#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47102#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47099#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47097#L36 assume true; 47095#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 47093#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47091#L35 assume true; 47089#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47087#L36 assume true; 47085#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47083#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47081#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47079#L36 assume true; 47077#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47075#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47073#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47071#L36 assume true; 47069#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47067#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47065#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47061#L36 assume true; 47060#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 47059#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47058#L35 assume true; 47057#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 47056#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 47055#L34 assume true; 47054#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 47053#L35 assume true; 47052#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47051#L36 assume true; 47050#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47049#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47048#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47047#L36 assume true; 47046#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47045#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47044#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47043#L36 assume true; 47042#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47041#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47040#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47039#L36 assume true; 47038#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 47037#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47036#L35 assume true; 47035#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47034#L36 assume true; 47033#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47032#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47031#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47030#L36 assume true; 47029#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47028#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47027#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47026#L36 assume true; 47025#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47024#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47023#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47022#L36 assume true; 47021#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47020#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47019#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47017#L36 assume true; 47016#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 47015#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 47014#L35 assume true; 47013#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 47011#L36 assume true; 47010#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47009#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47008#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47007#L36 assume true; 47006#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47005#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47004#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 47003#L36 assume true; 47002#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 47001#L18 assume !(0 == __VERIFIER_assert_~cond#1); 47000#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46999#L36 assume true; 46998#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46997#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46996#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46995#L36 assume true; 46994#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46993#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46992#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46869#L36 assume true; 46866#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 46867#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46819#L35 assume true; 46820#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46811#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46812#L34 assume true; 46710#L34-2 [2024-11-17 08:34:37,198 INFO L747 eck$LassoCheckResult]: Loop: 46710#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 46704#L35 assume true; 46702#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46675#L36 assume true; 46676#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46745#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46743#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46741#L36 assume true; 46739#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46735#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46733#L36 assume true; 46731#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46729#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46727#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46725#L36 assume true; 46723#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46721#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46719#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46717#L36 assume true; 46706#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46714#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46712#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46705#L36 assume true; 46698#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 46699#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46810#L35 assume true; 46809#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46808#L36 assume true; 46807#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46805#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46804#L36 assume true; 46803#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46802#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46801#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46800#L36 assume true; 46799#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46798#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46797#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46796#L36 assume true; 46795#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46794#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46793#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46792#L36 assume true; 46789#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46791#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46790#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46788#L36 assume true; 46765#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 46787#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46786#L35 assume true; 46785#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46784#L36 assume true; 46755#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46783#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46782#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46781#L36 assume true; 46780#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46779#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46778#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46777#L36 assume true; 46776#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46775#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46774#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46773#L36 assume true; 46772#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46771#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46770#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46769#L36 assume true; 46768#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46767#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46766#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46764#L36 assume true; 46761#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46763#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46762#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46760#L36 assume true; 46759#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 46758#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46757#L35 assume true; 46756#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 46754#L36 assume true; 46753#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46752#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46751#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46750#L36 assume true; 46749#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46748#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46747#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46746#L36 assume true; 46744#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46742#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46740#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46738#L36 assume true; 46736#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46734#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46732#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46730#L36 assume true; 46728#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46726#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46724#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46722#L36 assume true; 46720#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46718#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46716#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46715#L36 assume true; 46708#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 46711#L18 assume !(0 == __VERIFIER_assert_~cond#1); 46709#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 46707#L36 assume true; 46703#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 46686#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46687#L35 assume true; 46696#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 46692#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 46693#L34 assume true; 46710#L34-2 [2024-11-17 08:34:37,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2061028925, now seen corresponding path program 14 times [2024-11-17 08:34:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:37,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700371511] [2024-11-17 08:34:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:37,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:37,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 399597178, now seen corresponding path program 13 times [2024-11-17 08:34:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:37,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936392306] [2024-11-17 08:34:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 669 proven. 190 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-11-17 08:34:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936392306] [2024-11-17 08:34:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936392306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718103130] [2024-11-17 08:34:37,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:34:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:37,477 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:37,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2024-11-17 08:34:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:37,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:34:37,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 669 proven. 190 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-11-17 08:34:37,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 669 proven. 190 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-11-17 08:34:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718103130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:37,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2024-11-17 08:34:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774700888] [2024-11-17 08:34:37,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:37,811 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 08:34:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-17 08:34:37,812 INFO L87 Difference]: Start difference. First operand 675 states and 709 transitions. cyclomatic complexity: 40 Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:38,028 INFO L93 Difference]: Finished difference Result 743 states and 773 transitions. [2024-11-17 08:34:38,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 743 states and 773 transitions. [2024-11-17 08:34:38,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2024-11-17 08:34:38,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 743 states to 671 states and 698 transitions. [2024-11-17 08:34:38,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:34:38,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:34:38,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 671 states and 698 transitions. [2024-11-17 08:34:38,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:38,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 671 states and 698 transitions. [2024-11-17 08:34:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states and 698 transitions. [2024-11-17 08:34:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 623. [2024-11-17 08:34:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 623 states have (on average 1.043338683788122) internal successors, (650), 622 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 650 transitions. [2024-11-17 08:34:38,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 623 states and 650 transitions. [2024-11-17 08:34:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 08:34:38,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 623 states and 650 transitions. [2024-11-17 08:34:38,042 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-17 08:34:38,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 623 states and 650 transitions. [2024-11-17 08:34:38,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2024-11-17 08:34:38,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:38,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:38,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 18, 18, 18, 10, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:38,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 24, 24, 24, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-17 08:34:38,045 INFO L745 eck$LassoCheckResult]: Stem: 48828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 48829#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 48840#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 48841#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 48830#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 48831#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 48832#L34 assume true; 48848#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49116#L35 assume true; 48980#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48981#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49112#L34 assume true; 49113#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49251#L35 assume true; 49249#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49247#L36 assume true; 49246#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49244#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49242#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49239#L36 assume true; 49237#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 49235#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49233#L35 assume true; 49231#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49229#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49227#L34 assume true; 49225#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49224#L35 assume true; 49223#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49222#L36 assume true; 49221#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49220#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49219#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49218#L36 assume true; 49217#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49216#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49215#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49214#L36 assume true; 49213#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 49212#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49211#L35 assume true; 49210#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49209#L36 assume true; 49208#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49207#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49206#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49205#L36 assume true; 49204#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49203#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49202#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49201#L36 assume true; 49200#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49199#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49198#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49197#L36 assume true; 49196#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 49195#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49194#L35 assume true; 49193#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 49192#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49191#L34 assume true; 49189#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 49188#L35 assume true; 49187#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49186#L36 assume true; 49185#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49184#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49183#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49182#L36 assume true; 49181#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49180#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49179#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49178#L36 assume true; 49177#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49176#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49175#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49174#L36 assume true; 49173#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 49172#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49171#L35 assume true; 49170#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49169#L36 assume true; 49168#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49167#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49166#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49165#L36 assume true; 49164#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49163#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49162#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49161#L36 assume true; 49160#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49159#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49158#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49157#L36 assume true; 49156#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49155#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49154#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49152#L36 assume true; 49151#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 49150#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 49149#L35 assume true; 49148#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 49146#L36 assume true; 49145#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49144#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49143#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49142#L36 assume true; 49141#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49140#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49139#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49138#L36 assume true; 49137#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49136#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49135#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49134#L36 assume true; 49133#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49132#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49131#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49130#L36 assume true; 49129#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 49124#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 49119#L36 assume true; 49120#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 48982#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48983#L35 assume true; 48975#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48976#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49190#L34 assume true; 48867#L34-2 [2024-11-17 08:34:38,045 INFO L747 eck$LassoCheckResult]: Loop: 48867#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 48861#L35 assume true; 48859#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48833#L36 assume true; 48834#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48920#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48919#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48918#L36 assume true; 48917#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48916#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48915#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48914#L36 assume true; 48913#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48912#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48911#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48910#L36 assume true; 48909#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48908#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48907#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48906#L36 assume true; 48863#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48871#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48869#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48862#L36 assume true; 48856#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 48857#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48971#L35 assume true; 48970#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48969#L36 assume true; 48968#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48967#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48966#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48965#L36 assume true; 48964#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48963#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48962#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48961#L36 assume true; 48960#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48959#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48958#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48957#L36 assume true; 48956#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48954#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48953#L36 assume true; 48952#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48951#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48950#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48949#L36 assume true; 48946#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48948#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48947#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48945#L36 assume true; 48944#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 48943#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48942#L35 assume true; 48941#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48940#L36 assume true; 48897#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48939#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48938#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48937#L36 assume true; 48936#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48935#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48934#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48933#L36 assume true; 48932#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48931#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48930#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48929#L36 assume true; 48928#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48927#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48926#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48925#L36 assume true; 48924#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48923#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48922#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48921#L36 assume true; 48903#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48905#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48904#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48902#L36 assume true; 48901#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 48900#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48899#L35 assume true; 48898#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 48896#L36 assume true; 48895#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48893#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48892#L36 assume true; 48891#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48890#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48889#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48888#L36 assume true; 48887#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48886#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48885#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48884#L36 assume true; 48883#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48882#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48881#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48880#L36 assume true; 48879#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48877#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48876#L36 assume true; 48875#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48874#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48873#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48872#L36 assume true; 48865#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 48868#L18 assume !(0 == __VERIFIER_assert_~cond#1); 48866#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 48864#L36 assume true; 48860#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 48842#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 48843#L35 assume true; 48854#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 48850#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48851#L34 assume true; 48867#L34-2 [2024-11-17 08:34:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2061028925, now seen corresponding path program 15 times [2024-11-17 08:34:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116000729] [2024-11-17 08:34:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:38,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:38,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:38,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1113803870, now seen corresponding path program 14 times [2024-11-17 08:34:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:38,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230241477] [2024-11-17 08:34:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 639 proven. 522 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-17 08:34:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230241477] [2024-11-17 08:34:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230241477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641793963] [2024-11-17 08:34:38,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:34:38,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:38,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:38,355 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:38,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2024-11-17 08:34:38,452 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:34:38,452 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:38,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 08:34:38,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 639 proven. 522 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-17 08:34:38,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 639 proven. 522 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-17 08:34:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641793963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:38,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:38,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2024-11-17 08:34:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780621778] [2024-11-17 08:34:38,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:38,722 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:38,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:38,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 08:34:38,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-17 08:34:38,723 INFO L87 Difference]: Start difference. First operand 623 states and 650 transitions. cyclomatic complexity: 33 Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:39,008 INFO L93 Difference]: Finished difference Result 702 states and 731 transitions. [2024-11-17 08:34:39,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 731 transitions. [2024-11-17 08:34:39,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2024-11-17 08:34:39,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 699 states and 728 transitions. [2024-11-17 08:34:39,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:34:39,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:34:39,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 728 transitions. [2024-11-17 08:34:39,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:39,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 699 states and 728 transitions. [2024-11-17 08:34:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 728 transitions. [2024-11-17 08:34:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 634. [2024-11-17 08:34:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.0425867507886435) internal successors, (661), 633 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 661 transitions. [2024-11-17 08:34:39,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 661 transitions. [2024-11-17 08:34:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-17 08:34:39,020 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 661 transitions. [2024-11-17 08:34:39,020 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-17 08:34:39,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 661 transitions. [2024-11-17 08:34:39,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 125 [2024-11-17 08:34:39,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:39,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:39,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 18, 18, 18, 10, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:39,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 25, 25, 25, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-17 08:34:39,024 INFO L745 eck$LassoCheckResult]: Stem: 50935#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 50936#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 50947#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 50948#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 50937#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 50938#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 50939#L34 assume true; 50955#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 51225#L35 assume true; 51091#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 51092#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51221#L34 assume true; 51222#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 51287#L35 assume true; 51284#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51285#L36 assume true; 51241#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51242#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51236#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51237#L36 assume true; 51315#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51314#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51313#L35 assume true; 51312#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 51311#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51310#L34 assume true; 51309#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 51308#L35 assume true; 51307#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51306#L36 assume true; 51305#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51304#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51303#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51302#L36 assume true; 51301#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51300#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51299#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51298#L36 assume true; 51297#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51296#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51295#L35 assume true; 51294#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51293#L36 assume true; 51292#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51291#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51290#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51289#L36 assume true; 51288#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51286#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51283#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51248#L36 assume true; 51249#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51239#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51240#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51233#L36 assume true; 51234#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51402#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51401#L35 assume true; 51400#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 51399#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51398#L34 assume true; 50946#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 50945#L35 assume true; 51469#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51468#L36 assume true; 51467#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51466#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51465#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51464#L36 assume true; 51463#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51462#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51461#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51460#L36 assume true; 51459#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51458#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51457#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51456#L36 assume true; 51455#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51454#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51453#L35 assume true; 51452#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51451#L36 assume true; 51450#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51448#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51447#L36 assume true; 51446#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51444#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51443#L36 assume true; 51442#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51441#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51440#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51439#L36 assume true; 51438#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51437#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51436#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51434#L36 assume true; 51433#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51432#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51431#L35 assume true; 51430#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51428#L36 assume true; 51427#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51426#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51425#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51424#L36 assume true; 51423#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51422#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51421#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51420#L36 assume true; 51419#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51418#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51417#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51416#L36 assume true; 51415#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51413#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51412#L36 assume true; 51411#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51410#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51409#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51408#L36 assume true; 51407#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51406#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51405#L35 assume true; 51404#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 51403#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51397#L34 assume true; 50974#L34-2 [2024-11-17 08:34:39,024 INFO L747 eck$LassoCheckResult]: Loop: 50974#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 50966#L35 assume true; 50967#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 50940#L36 assume true; 50941#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51028#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51027#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51026#L36 assume true; 51025#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51024#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51023#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51022#L36 assume true; 51021#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51020#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51019#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51018#L36 assume true; 51017#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51016#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51015#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51014#L36 assume true; 50977#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50979#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50978#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50976#L36 assume true; 50964#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 50965#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51083#L35 assume true; 51082#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51081#L36 assume true; 51080#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51079#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51078#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51077#L36 assume true; 51076#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51075#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51074#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51073#L36 assume true; 51072#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51071#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51070#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51069#L36 assume true; 51068#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51067#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51066#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51065#L36 assume true; 51064#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51063#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51062#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51061#L36 assume true; 51058#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51060#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51059#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51057#L36 assume true; 51056#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51055#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51054#L35 assume true; 51053#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51052#L36 assume true; 51005#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51051#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51050#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51049#L36 assume true; 51048#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51047#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51046#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51045#L36 assume true; 51044#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51043#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51042#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51041#L36 assume true; 51040#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51039#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51038#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51037#L36 assume true; 51036#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51035#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51034#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51033#L36 assume true; 51032#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51031#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51030#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51029#L36 assume true; 51011#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51013#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51012#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51010#L36 assume true; 51009#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 51008#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 51007#L35 assume true; 51006#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 51004#L36 assume true; 51003#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 51002#L18 assume !(0 == __VERIFIER_assert_~cond#1); 51001#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 51000#L36 assume true; 50999#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50998#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50997#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50996#L36 assume true; 50995#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50993#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50992#L36 assume true; 50991#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50990#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50989#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50988#L36 assume true; 50987#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50986#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50985#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50984#L36 assume true; 50983#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50982#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50981#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50980#L36 assume true; 50971#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50973#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50972#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50970#L36 assume true; 50969#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 50951#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 50952#L35 assume true; 50962#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 50958#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 50959#L34 assume true; 50974#L34-2 [2024-11-17 08:34:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2061028925, now seen corresponding path program 16 times [2024-11-17 08:34:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049505175] [2024-11-17 08:34:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:39,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:39,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:39,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 921614970, now seen corresponding path program 15 times [2024-11-17 08:34:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931268865] [2024-11-17 08:34:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 72 proven. 1146 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-17 08:34:39,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931268865] [2024-11-17 08:34:39,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931268865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095396875] [2024-11-17 08:34:39,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:34:39,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:39,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:39,345 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:39,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2024-11-17 08:34:39,454 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-11-17 08:34:39,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:39,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:34:39,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 815 proven. 350 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-11-17 08:34:39,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 815 proven. 350 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-11-17 08:34:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095396875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:40,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 32 [2024-11-17 08:34:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2331927] [2024-11-17 08:34:40,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:40,099 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:40,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 08:34:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2024-11-17 08:34:40,100 INFO L87 Difference]: Start difference. First operand 634 states and 661 transitions. cyclomatic complexity: 33 Second operand has 32 states, 32 states have (on average 4.3125) internal successors, (138), 32 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:43,313 INFO L93 Difference]: Finished difference Result 1520 states and 1577 transitions. [2024-11-17 08:34:43,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1520 states and 1577 transitions. [2024-11-17 08:34:43,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2024-11-17 08:34:43,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1520 states to 1276 states and 1327 transitions. [2024-11-17 08:34:43,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-17 08:34:43,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-17 08:34:43,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1276 states and 1327 transitions. [2024-11-17 08:34:43,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:43,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1276 states and 1327 transitions. [2024-11-17 08:34:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states and 1327 transitions. [2024-11-17 08:34:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 967. [2024-11-17 08:34:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 967 states have (on average 1.0423991726990693) internal successors, (1008), 966 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1008 transitions. [2024-11-17 08:34:43,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 967 states and 1008 transitions. [2024-11-17 08:34:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-11-17 08:34:43,335 INFO L425 stractBuchiCegarLoop]: Abstraction has 967 states and 1008 transitions. [2024-11-17 08:34:43,335 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-17 08:34:43,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 967 states and 1008 transitions. [2024-11-17 08:34:43,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-11-17 08:34:43,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:43,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:43,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 18, 18, 18, 10, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:43,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [39, 34, 34, 34, 6, 5, 5, 5, 1, 1, 1, 1] [2024-11-17 08:34:43,340 INFO L745 eck$LassoCheckResult]: Stem: 54148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 54149#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 54160#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 54161#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 54150#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 54151#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 54152#L34 assume true; 54168#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 54255#L35 assume true; 54253#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 54251#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 54231#L34 assume true; 54233#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 54397#L35 assume true; 54394#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54395#L36 assume true; 54383#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54382#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54380#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54381#L36 assume true; 54455#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54454#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54453#L35 assume true; 54452#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 54450#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 54447#L34 assume true; 54445#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 54443#L35 assume true; 54441#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54439#L36 assume true; 54437#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54435#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54433#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54431#L36 assume true; 54429#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54425#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54423#L36 assume true; 54421#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54419#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54417#L35 assume true; 54415#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54413#L36 assume true; 54411#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54409#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54407#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54405#L36 assume true; 54403#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54401#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54393#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54391#L36 assume true; 54392#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54456#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54378#L36 assume true; 54379#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54647#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54646#L35 assume true; 54373#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 54172#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 54169#L34 assume true; 54159#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 54158#L35 assume true; 54712#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54711#L36 assume true; 54710#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54709#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54708#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54707#L36 assume true; 54706#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54705#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54704#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54703#L36 assume true; 54702#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54701#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54700#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54699#L36 assume true; 54698#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54697#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54696#L35 assume true; 54695#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54694#L36 assume true; 54693#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54692#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54691#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54690#L36 assume true; 54689#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54688#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54687#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54686#L36 assume true; 54685#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54684#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54683#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54682#L36 assume true; 54681#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54680#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54679#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54677#L36 assume true; 54676#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54675#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54674#L35 assume true; 54673#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54671#L36 assume true; 54670#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54669#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54668#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54667#L36 assume true; 54666#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54665#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54664#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54663#L36 assume true; 54662#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54661#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54660#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54659#L36 assume true; 54658#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54656#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54655#L36 assume true; 54654#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54652#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54651#L36 assume true; 54650#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54649#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54648#L35 assume true; 54239#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 54240#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 54645#L34 assume true; 54185#L34-2 [2024-11-17 08:34:43,340 INFO L747 eck$LassoCheckResult]: Loop: 54185#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 54182#L35 assume true; 54180#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54153#L36 assume true; 54154#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54767#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54766#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54765#L36 assume true; 54764#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54763#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54762#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54761#L36 assume true; 54760#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54759#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54758#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54757#L36 assume true; 54756#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54755#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54754#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54753#L36 assume true; 54244#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54241#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54242#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54228#L36 assume true; 54230#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54873#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54872#L35 assume true; 54871#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54870#L36 assume true; 54869#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54868#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54867#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54866#L36 assume true; 54865#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54864#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54863#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54862#L36 assume true; 54861#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54860#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54859#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54858#L36 assume true; 54857#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54856#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54855#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54854#L36 assume true; 54853#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54852#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54850#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54848#L36 assume true; 54845#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54843#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54841#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54838#L36 assume true; 54836#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54834#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54832#L35 assume true; 54830#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54828#L36 assume true; 54827#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54826#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54825#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54824#L36 assume true; 54823#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54822#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54821#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54820#L36 assume true; 54819#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54818#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54817#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54816#L36 assume true; 54815#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54814#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54813#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54812#L36 assume true; 54811#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54810#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54809#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54808#L36 assume true; 54807#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54805#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54804#L36 assume true; 54801#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54803#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54802#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54800#L36 assume true; 54799#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54798#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54797#L35 assume true; 54796#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54795#L36 assume true; 54219#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54794#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54793#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54792#L36 assume true; 54791#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54790#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54789#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54788#L36 assume true; 54787#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54786#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54785#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54784#L36 assume true; 54783#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54782#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54781#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54780#L36 assume true; 54779#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54778#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54777#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54776#L36 assume true; 54775#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54774#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54773#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54772#L36 assume true; 54771#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54770#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54769#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54768#L36 assume true; 54225#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54227#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54226#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54224#L36 assume true; 54223#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54222#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54221#L35 assume true; 54220#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 54218#L36 assume true; 54217#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54216#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54215#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54214#L36 assume true; 54213#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54211#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54210#L36 assume true; 54209#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54208#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54207#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54206#L36 assume true; 54205#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54204#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54203#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54202#L36 assume true; 54201#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54200#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54199#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54198#L36 assume true; 54197#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54196#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54195#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54194#L36 assume true; 54193#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54192#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54191#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54190#L36 assume true; 54184#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 54189#L18 assume !(0 == __VERIFIER_assert_~cond#1); 54186#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 54183#L36 assume true; 54181#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 54164#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 54165#L35 assume true; 54174#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 54170#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 54171#L34 assume true; 54185#L34-2 [2024-11-17 08:34:43,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2061028925, now seen corresponding path program 17 times [2024-11-17 08:34:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779677159] [2024-11-17 08:34:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:43,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:43,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:43,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2002364660, now seen corresponding path program 16 times [2024-11-17 08:34:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244466554] [2024-11-17 08:34:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2644 backedges. 32 proven. 1532 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2024-11-17 08:34:43,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244466554] [2024-11-17 08:34:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244466554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617075193] [2024-11-17 08:34:43,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:34:43,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:43,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:43,892 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:43,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-11-17 08:34:44,016 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:34:44,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:44,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:34:44,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2644 backedges. 836 proven. 1510 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-17 08:34:44,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2644 backedges. 836 proven. 1510 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-17 08:34:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617075193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:45,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 39 [2024-11-17 08:34:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172819885] [2024-11-17 08:34:45,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:45,063 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-17 08:34:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2024-11-17 08:34:45,065 INFO L87 Difference]: Start difference. First operand 967 states and 1008 transitions. cyclomatic complexity: 47 Second operand has 39 states, 39 states have (on average 4.051282051282051) internal successors, (158), 39 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:47,843 INFO L93 Difference]: Finished difference Result 1535 states and 1602 transitions. [2024-11-17 08:34:47,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1535 states and 1602 transitions. [2024-11-17 08:34:47,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 381 [2024-11-17 08:34:47,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1535 states to 1138 states and 1185 transitions. [2024-11-17 08:34:47,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-17 08:34:47,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-17 08:34:47,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1185 transitions. [2024-11-17 08:34:47,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:47,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1185 transitions. [2024-11-17 08:34:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1185 transitions. [2024-11-17 08:34:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 781. [2024-11-17 08:34:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 781 states have (on average 1.0422535211267605) internal successors, (814), 780 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 814 transitions. [2024-11-17 08:34:47,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 781 states and 814 transitions. [2024-11-17 08:34:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-11-17 08:34:47,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 781 states and 814 transitions. [2024-11-17 08:34:47,859 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-17 08:34:47,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 781 states and 814 transitions. [2024-11-17 08:34:47,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 297 [2024-11-17 08:34:47,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:47,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:47,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 18, 18, 18, 10, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:47,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [40, 35, 35, 35, 6, 5, 5, 5, 1, 1, 1, 1] [2024-11-17 08:34:47,866 INFO L745 eck$LassoCheckResult]: Stem: 57894#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 57895#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 57906#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 57907#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 57896#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 57897#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 57898#L34 assume true; 57914#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 57961#L35 assume true; 57959#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 57957#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57944#L34 assume true; 57946#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58102#L35 assume true; 58099#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58100#L36 assume true; 58094#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58095#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58090#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58091#L36 assume true; 58086#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58087#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58082#L35 assume true; 58083#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 57919#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57920#L34 assume true; 58124#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58123#L35 assume true; 58122#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58121#L36 assume true; 58120#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58119#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58118#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58117#L36 assume true; 58116#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58115#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58114#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58113#L36 assume true; 58112#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58111#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58110#L35 assume true; 58109#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58108#L36 assume true; 58107#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58106#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58105#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58104#L36 assume true; 58103#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58101#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58098#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58096#L36 assume true; 58097#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58092#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58093#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58088#L36 assume true; 58089#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58084#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58085#L35 assume true; 58080#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58081#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57915#L34 assume true; 57916#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 58216#L35 assume true; 58215#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58214#L36 assume true; 58213#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58211#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58210#L36 assume true; 58209#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58208#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58207#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58206#L36 assume true; 58205#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58204#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58203#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58202#L36 assume true; 58201#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58200#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58199#L35 assume true; 58198#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58197#L36 assume true; 58196#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58194#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58193#L36 assume true; 58192#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58190#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58189#L36 assume true; 58188#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58186#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58185#L36 assume true; 58184#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58182#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58180#L36 assume true; 58179#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58178#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58177#L35 assume true; 58176#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58174#L36 assume true; 58173#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58172#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58171#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58170#L36 assume true; 58169#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58168#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58167#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58166#L36 assume true; 58165#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58164#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58163#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58162#L36 assume true; 58161#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58160#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58159#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58158#L36 assume true; 58157#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58156#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58155#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58148#L36 assume true; 58149#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58221#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58220#L35 assume true; 58219#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 58218#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58217#L34 assume true; 57929#L34-2 [2024-11-17 08:34:47,866 INFO L747 eck$LassoCheckResult]: Loop: 57929#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 57926#L35 assume true; 57927#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57899#L36 assume true; 57900#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58140#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58139#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58138#L36 assume true; 58137#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58136#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58135#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58134#L36 assume true; 58133#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58132#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58131#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58130#L36 assume true; 58129#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58128#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58127#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58125#L36 assume true; 58126#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57937#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57938#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58630#L36 assume true; 57924#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 57910#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57911#L35 assume true; 57922#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 57923#L36 assume true; 58674#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57912#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57913#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57901#L36 assume true; 57902#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58673#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58672#L36 assume true; 58671#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58670#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58669#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58668#L36 assume true; 58667#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58666#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58665#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58664#L36 assume true; 58663#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58662#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58661#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58660#L36 assume true; 58432#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58431#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58430#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58428#L36 assume true; 58426#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58427#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58659#L35 assume true; 58658#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58657#L36 assume true; 58656#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58655#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58654#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58653#L36 assume true; 58652#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58651#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58650#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58649#L36 assume true; 58648#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58647#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58646#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58645#L36 assume true; 58644#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58643#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58642#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58641#L36 assume true; 58640#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58639#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58638#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58637#L36 assume true; 58636#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58635#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58634#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58633#L36 assume true; 58522#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58597#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58560#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58521#L36 assume true; 58513#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58510#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58509#L35 assume true; 58507#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58462#L36 assume true; 58461#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58459#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58457#L36 assume true; 58456#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58455#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58454#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58453#L36 assume true; 58452#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58451#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58450#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58449#L36 assume true; 58448#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58446#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58445#L36 assume true; 58444#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58443#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58442#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58441#L36 assume true; 58440#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58439#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58438#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58437#L36 assume true; 58436#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58435#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58434#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58433#L36 assume true; 58423#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58425#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58424#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58422#L36 assume true; 58421#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 58420#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 58419#L35 assume true; 58418#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 58416#L36 assume true; 58415#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58413#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58412#L36 assume true; 58411#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58410#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58409#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58408#L36 assume true; 58407#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58405#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58404#L36 assume true; 58403#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58402#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58401#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58400#L36 assume true; 58399#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58398#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58397#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58396#L36 assume true; 58395#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58394#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58393#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58392#L36 assume true; 58391#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58390#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58389#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58388#L36 assume true; 58387#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 58386#L18 assume !(0 == __VERIFIER_assert_~cond#1); 58385#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 58384#L36 assume true; 57943#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 57950#L18 assume !(0 == __VERIFIER_assert_~cond#1); 57947#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 57942#L36 assume true; 57928#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 57908#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 57909#L35 assume true; 57921#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 57917#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 57918#L34 assume true; 57929#L34-2 [2024-11-17 08:34:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2061028925, now seen corresponding path program 18 times [2024-11-17 08:34:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110612467] [2024-11-17 08:34:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:47,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:47,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:47,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 525488924, now seen corresponding path program 17 times [2024-11-17 08:34:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026382397] [2024-11-17 08:34:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:47,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:47,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1614015906, now seen corresponding path program 19 times [2024-11-17 08:34:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427804055] [2024-11-17 08:34:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7118 backedges. 3575 proven. 963 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2024-11-17 08:34:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427804055] [2024-11-17 08:34:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427804055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598454118] [2024-11-17 08:34:48,329 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:34:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:48,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:48,331 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:48,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-11-17 08:34:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:48,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:34:48,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7118 backedges. 3575 proven. 963 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2024-11-17 08:34:48,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7118 backedges. 3575 proven. 963 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2024-11-17 08:34:48,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598454118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:48,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-17 08:34:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286658335] [2024-11-17 08:34:48,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:51,700 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:51,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:51,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:51,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:51,701 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:51,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:51,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:51,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration22_Loop [2024-11-17 08:34:51,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:51,701 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:51,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,758 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:51,758 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:51,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,762 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-17 08:34:51,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:51,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:51,779 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:51,779 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:51,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:51,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,796 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-17 08:34:51,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:51,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:51,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-17 08:34:51,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,820 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-17 08:34:51,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:51,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:51,834 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:51,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-17 08:34:51,844 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:51,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:51,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:51,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:51,844 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:51,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:51,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:51,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration22_Loop [2024-11-17 08:34:51,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:51,845 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:51,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:51,889 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:51,889 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:51,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,890 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-17 08:34:51,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:51,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:51,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:51,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:51,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:51,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:51,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:51,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:51,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:51,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-17 08:34:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,915 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-17 08:34:51,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:51,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:51,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:51,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:51,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:51,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:51,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:51,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:51,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:51,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-17 08:34:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,940 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-17 08:34:51,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:34:51,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:51,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:51,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:51,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:51,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:51,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:51,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:51,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:51,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:51,956 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:51,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:51,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:51,957 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:51,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-17 08:34:51,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:51,959 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:51,959 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:51,959 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 11 Supporting invariants [] [2024-11-17 08:34:51,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-17 08:34:51,969 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:52,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:52,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:52,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:52,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:34:52,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2024-11-17 08:34:52,834 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2024-11-17 08:34:52,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 781 states and 814 transitions. cyclomatic complexity: 42 Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:53,152 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 781 states and 814 transitions. cyclomatic complexity: 42. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2200 states and 2283 transitions. Complement of second has 34 states. [2024-11-17 08:34:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2024-11-17 08:34:53,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 129 letters. Loop has 170 letters. [2024-11-17 08:34:53,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:53,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 299 letters. Loop has 170 letters. [2024-11-17 08:34:53,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:53,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 129 letters. Loop has 340 letters. [2024-11-17 08:34:53,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:53,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2200 states and 2283 transitions. [2024-11-17 08:34:53,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 321 [2024-11-17 08:34:53,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2200 states to 1435 states and 1491 transitions. [2024-11-17 08:34:53,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-17 08:34:53,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:34:53,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1435 states and 1491 transitions. [2024-11-17 08:34:53,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:53,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1435 states and 1491 transitions. [2024-11-17 08:34:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states and 1491 transitions. [2024-11-17 08:34:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1316. [2024-11-17 08:34:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1316 states have (on average 1.0425531914893618) internal successors, (1372), 1315 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1372 transitions. [2024-11-17 08:34:53,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1316 states and 1372 transitions. [2024-11-17 08:34:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 08:34:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-17 08:34:53,183 INFO L87 Difference]: Start difference. First operand 1316 states and 1372 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:53,566 INFO L93 Difference]: Finished difference Result 2220 states and 2311 transitions. [2024-11-17 08:34:53,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2220 states and 2311 transitions. [2024-11-17 08:34:53,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 297 [2024-11-17 08:34:53,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2220 states to 1986 states and 2063 transitions. [2024-11-17 08:34:53,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-17 08:34:53,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-17 08:34:53,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1986 states and 2063 transitions. [2024-11-17 08:34:53,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:53,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1986 states and 2063 transitions. [2024-11-17 08:34:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states and 2063 transitions. [2024-11-17 08:34:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1552. [2024-11-17 08:34:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1552 states have (on average 1.0399484536082475) internal successors, (1614), 1551 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1614 transitions. [2024-11-17 08:34:53,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1552 states and 1614 transitions. [2024-11-17 08:34:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-17 08:34:53,595 INFO L425 stractBuchiCegarLoop]: Abstraction has 1552 states and 1614 transitions. [2024-11-17 08:34:53,596 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-17 08:34:53,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1552 states and 1614 transitions. [2024-11-17 08:34:53,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 297 [2024-11-17 08:34:53,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:53,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:53,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [39, 30, 30, 30, 14, 9, 9, 9, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:53,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [41, 36, 36, 36, 6, 5, 5, 5, 1, 1, 1, 1] [2024-11-17 08:34:53,601 INFO L745 eck$LassoCheckResult]: Stem: 67253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 67254#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 67266#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 67267#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 67255#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 67256#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 67257#L34 assume true; 67274#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 67596#L35 assume true; 67595#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67594#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 67578#L34 assume true; 67580#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 67856#L35 assume true; 67854#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67855#L36 assume true; 67924#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67922#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67920#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67918#L36 assume true; 67916#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67914#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67912#L35 assume true; 67910#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67908#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 67906#L34 assume true; 67904#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 67902#L35 assume true; 67900#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67898#L36 assume true; 67896#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67892#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67890#L36 assume true; 67888#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67885#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67883#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67881#L36 assume true; 67879#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67877#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67875#L35 assume true; 67873#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67869#L36 assume true; 67870#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67865#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67866#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67861#L36 assume true; 67862#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67857#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67858#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67793#L36 assume true; 67792#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67790#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67791#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67954#L36 assume true; 67953#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67952#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67951#L35 assume true; 67950#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67949#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 67948#L34 assume true; 67947#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 67946#L35 assume true; 67945#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67944#L36 assume true; 67943#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67942#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67941#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67940#L36 assume true; 67939#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67938#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67937#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67936#L36 assume true; 67935#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67934#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67933#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67932#L36 assume true; 67931#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67930#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67929#L35 assume true; 67928#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67927#L36 assume true; 67926#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67925#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67923#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67921#L36 assume true; 67919#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67917#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67915#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67913#L36 assume true; 67911#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67909#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67907#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67905#L36 assume true; 67903#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67901#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67899#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67897#L36 assume true; 67895#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67893#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67891#L35 assume true; 67889#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67886#L36 assume true; 67884#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67882#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67880#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67878#L36 assume true; 67876#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67874#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67871#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67872#L36 assume true; 67867#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67868#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67863#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67864#L36 assume true; 67859#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67860#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67852#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67853#L36 assume true; 67956#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67955#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67789#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67788#L36 assume true; 67787#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67786#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67785#L35 assume true; 67784#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67278#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 67279#L34 assume true; 68458#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 68457#L35 assume true; 68456#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68455#L36 assume true; 68454#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68452#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68451#L36 assume true; 68450#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68448#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68447#L36 assume true; 68446#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68444#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68443#L36 assume true; 68442#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 68441#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68440#L35 assume true; 68439#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68438#L36 assume true; 68437#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68435#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68434#L36 assume true; 68433#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68432#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68431#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68430#L36 assume true; 68429#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68428#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68427#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68426#L36 assume true; 68424#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68422#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68420#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68417#L36 assume true; 68415#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 68413#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68411#L35 assume true; 68409#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 68406#L36 assume true; 68404#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68402#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68400#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68398#L36 assume true; 68396#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68394#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68392#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68390#L36 assume true; 68388#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68386#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68384#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68382#L36 assume true; 68380#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68378#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68376#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68372#L36 assume true; 68373#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 68364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 68365#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 68356#L36 assume true; 68352#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 68353#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 68344#L35 assume true; 68345#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67576#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 67577#L34 assume true; 67289#L34-2 [2024-11-17 08:34:53,602 INFO L747 eck$LassoCheckResult]: Loop: 67289#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 67285#L35 assume true; 67286#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67258#L36 assume true; 67259#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67547#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67545#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67543#L36 assume true; 67541#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67540#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67538#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67536#L36 assume true; 67534#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67532#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67530#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67528#L36 assume true; 67526#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67524#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67522#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67520#L36 assume true; 67518#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67516#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67514#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67512#L36 assume true; 67510#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67508#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67505#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67502#L36 assume true; 67498#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67496#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67494#L35 assume true; 67492#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67490#L36 assume true; 67488#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67486#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67484#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67482#L36 assume true; 67480#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67478#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67476#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67474#L36 assume true; 67472#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67470#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67468#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67466#L36 assume true; 67464#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67463#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67461#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67459#L36 assume true; 67456#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67454#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67452#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67450#L36 assume true; 67448#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67446#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67444#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67441#L36 assume true; 67439#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67437#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67435#L35 assume true; 67433#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67431#L36 assume true; 67429#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67425#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67423#L36 assume true; 67421#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67419#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67417#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67415#L36 assume true; 67413#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67409#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67407#L36 assume true; 67405#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67403#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67401#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67399#L36 assume true; 67397#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67395#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67393#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67391#L36 assume true; 67389#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67388#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67386#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67384#L36 assume true; 67376#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67378#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67375#L36 assume true; 67373#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67371#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67370#L35 assume true; 67368#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67366#L36 assume true; 67365#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67363#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67362#L36 assume true; 67361#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67360#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67359#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67358#L36 assume true; 67357#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67356#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67355#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67354#L36 assume true; 67353#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67352#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67351#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67350#L36 assume true; 67349#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67348#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67347#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67346#L36 assume true; 67345#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67344#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67343#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67342#L36 assume true; 67341#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67339#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67338#L36 assume true; 67335#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67337#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67336#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67334#L36 assume true; 67333#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67332#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67331#L35 assume true; 67330#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 67328#L36 assume true; 67327#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67326#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67325#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67324#L36 assume true; 67323#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67322#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67321#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67320#L36 assume true; 67319#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67318#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67317#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67316#L36 assume true; 67315#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67314#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67313#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67312#L36 assume true; 67311#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67310#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67309#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67308#L36 assume true; 67307#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67306#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67305#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67304#L36 assume true; 67303#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67302#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67301#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67300#L36 assume true; 67299#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67298#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67297#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67296#L36 assume true; 67291#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67295#L18 assume !(0 == __VERIFIER_assert_~cond#1); 67294#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 67290#L36 assume true; 67288#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 67268#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 67269#L35 assume true; 67280#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 67276#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 67277#L34 assume true; 67289#L34-2 [2024-11-17 08:34:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash -39608154, now seen corresponding path program 20 times [2024-11-17 08:34:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575487408] [2024-11-17 08:34:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1617 proven. 367 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-17 08:34:53,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:53,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575487408] [2024-11-17 08:34:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575487408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:53,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000019172] [2024-11-17 08:34:53,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:34:53,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:53,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:53,825 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:53,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2024-11-17 08:34:53,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:34:53,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:53,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:34:53,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1666 proven. 318 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-17 08:34:54,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1646 proven. 338 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-17 08:34:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000019172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:54,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-17 08:34:54,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023871561] [2024-11-17 08:34:54,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:54,483 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:34:54,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1641125188, now seen corresponding path program 18 times [2024-11-17 08:34:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:54,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70973041] [2024-11-17 08:34:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2940 backedges. 1404 proven. 264 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2024-11-17 08:34:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70973041] [2024-11-17 08:34:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70973041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937117566] [2024-11-17 08:34:54,781 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:34:54,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:54,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:54,783 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:54,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2024-11-17 08:34:54,940 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2024-11-17 08:34:54,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:54,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 08:34:54,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2940 backedges. 958 proven. 902 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2024-11-17 08:34:55,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2940 backedges. 578 proven. 1282 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2024-11-17 08:34:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937117566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:56,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:56,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 56 [2024-11-17 08:34:56,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428566413] [2024-11-17 08:34:56,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:56,187 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-17 08:34:56,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=2586, Unknown=0, NotChecked=0, Total=3080 [2024-11-17 08:34:56,189 INFO L87 Difference]: Start difference. First operand 1552 states and 1614 transitions. cyclomatic complexity: 75 Second operand has 56 states, 56 states have (on average 3.767857142857143) internal successors, (211), 56 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:59,840 INFO L93 Difference]: Finished difference Result 3289 states and 3475 transitions. [2024-11-17 08:34:59,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3289 states and 3475 transitions. [2024-11-17 08:34:59,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 556 [2024-11-17 08:34:59,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3289 states to 2426 states and 2556 transitions. [2024-11-17 08:34:59,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-17 08:34:59,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-17 08:34:59,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2426 states and 2556 transitions. [2024-11-17 08:34:59,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:59,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2426 states and 2556 transitions. [2024-11-17 08:34:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states and 2556 transitions. [2024-11-17 08:34:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1511. [2024-11-17 08:34:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1511 states have (on average 1.0502978160158836) internal successors, (1587), 1510 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1587 transitions. [2024-11-17 08:34:59,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1511 states and 1587 transitions. [2024-11-17 08:34:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2024-11-17 08:34:59,887 INFO L425 stractBuchiCegarLoop]: Abstraction has 1511 states and 1587 transitions. [2024-11-17 08:34:59,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-17 08:34:59,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1511 states and 1587 transitions. [2024-11-17 08:34:59,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2024-11-17 08:34:59,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:59,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:59,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [39, 30, 30, 30, 14, 9, 9, 9, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:59,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 50, 50, 50, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-17 08:34:59,895 INFO L745 eck$LassoCheckResult]: Stem: 74622#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 74623#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 74634#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 74635#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 74624#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 74625#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 74626#L34 assume true; 74642#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 74878#L35 assume true; 74877#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 74876#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 74874#L34 assume true; 74875#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75191#L35 assume true; 75190#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75189#L36 assume true; 75188#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75187#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75186#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75185#L36 assume true; 75184#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75183#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75182#L35 assume true; 75181#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75180#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75179#L34 assume true; 75178#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75177#L35 assume true; 75176#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75175#L36 assume true; 75174#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75173#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75172#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75171#L36 assume true; 75170#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75169#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75168#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75167#L36 assume true; 75166#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75165#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75164#L35 assume true; 75163#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75162#L36 assume true; 75161#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75160#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75159#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75158#L36 assume true; 75157#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75156#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75155#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75154#L36 assume true; 75153#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75152#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75151#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75150#L36 assume true; 75149#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75148#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75147#L35 assume true; 75146#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75145#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75144#L34 assume true; 75143#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75142#L35 assume true; 75141#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75140#L36 assume true; 75139#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75138#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75137#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75136#L36 assume true; 75135#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75134#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75133#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75132#L36 assume true; 75131#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75130#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75129#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75128#L36 assume true; 75127#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75126#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75125#L35 assume true; 75124#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75123#L36 assume true; 75122#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75121#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75120#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75119#L36 assume true; 75118#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75117#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75116#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75115#L36 assume true; 75114#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75112#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75111#L36 assume true; 75110#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75109#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75108#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75107#L36 assume true; 75106#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75105#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75104#L35 assume true; 75103#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75101#L36 assume true; 75100#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75099#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75098#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75097#L36 assume true; 75096#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75095#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75094#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75093#L36 assume true; 75092#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75090#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75089#L36 assume true; 75088#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75087#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75086#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75084#L36 assume true; 75082#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75080#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75078#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75076#L36 assume true; 75074#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75072#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75070#L35 assume true; 75068#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75066#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75064#L34 assume true; 75063#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 75062#L35 assume true; 75061#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75060#L36 assume true; 75059#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75057#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75056#L36 assume true; 75055#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75053#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75052#L36 assume true; 75051#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75049#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75048#L36 assume true; 75047#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75046#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75045#L35 assume true; 75044#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75043#L36 assume true; 75042#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75041#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75040#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75039#L36 assume true; 75038#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75035#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75033#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75031#L36 assume true; 75029#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75027#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75025#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75023#L36 assume true; 75021#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75019#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75017#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75014#L36 assume true; 75012#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75010#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75008#L35 assume true; 75006#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75000#L36 assume true; 75001#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74995#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74988#L36 assume true; 74989#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74982#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74983#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74976#L36 assume true; 74977#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74970#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74971#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74930#L36 assume true; 74931#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74926#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74927#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75085#L36 assume true; 75083#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75081#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75079#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75077#L36 assume true; 75075#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75073#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75071#L35 assume true; 75069#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 75067#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 75065#L34 assume true; 74656#L34-2 [2024-11-17 08:34:59,896 INFO L747 eck$LassoCheckResult]: Loop: 74656#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 74655#L35 assume true; 74654#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74627#L36 assume true; 74628#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74909#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74908#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74907#L36 assume true; 74906#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74905#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74904#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74903#L36 assume true; 74902#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74901#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74900#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74899#L36 assume true; 74898#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74897#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74896#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74895#L36 assume true; 74894#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74893#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74892#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74890#L36 assume true; 74891#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76109#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76108#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76106#L36 assume true; 76104#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 76102#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 76100#L35 assume true; 76098#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 76096#L36 assume true; 76095#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76094#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76093#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76092#L36 assume true; 76091#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76090#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76089#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76088#L36 assume true; 76087#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76086#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76085#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76084#L36 assume true; 76083#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76082#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76081#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76080#L36 assume true; 76079#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76078#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76077#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76076#L36 assume true; 76075#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76074#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76073#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76072#L36 assume true; 75591#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76071#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76070#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76069#L36 assume true; 75931#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 74638#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74639#L35 assume true; 74649#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 74650#L36 assume true; 76132#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74640#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74641#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74629#L36 assume true; 74630#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74653#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76131#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76130#L36 assume true; 76129#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76128#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76127#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76126#L36 assume true; 76125#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76124#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76123#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76122#L36 assume true; 76121#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76120#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76119#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76118#L36 assume true; 76117#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76116#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76115#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76114#L36 assume true; 76113#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76112#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76111#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76110#L36 assume true; 75547#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75935#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75934#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75932#L36 assume true; 75933#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 76068#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 76067#L35 assume true; 76066#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 76065#L36 assume true; 76064#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76063#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76062#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76061#L36 assume true; 76060#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76059#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76058#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76057#L36 assume true; 76056#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76055#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76054#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76053#L36 assume true; 76052#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76051#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76050#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76049#L36 assume true; 76048#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76047#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76046#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76045#L36 assume true; 76044#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76043#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76042#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76041#L36 assume true; 76040#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76039#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76038#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 76037#L36 assume true; 75440#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 76036#L18 assume !(0 == __VERIFIER_assert_~cond#1); 76035#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75936#L36 assume true; 75892#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75930#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75929#L35 assume true; 75928#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75927#L36 assume true; 75881#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75926#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75925#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75924#L36 assume true; 75923#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75922#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75921#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75920#L36 assume true; 75919#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75918#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75917#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75916#L36 assume true; 75915#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75914#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75913#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75912#L36 assume true; 75911#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75910#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75909#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75908#L36 assume true; 75907#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75906#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75905#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75904#L36 assume true; 75903#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75902#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75901#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75900#L36 assume true; 75899#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75898#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75897#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75896#L36 assume true; 75895#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75894#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75893#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75891#L36 assume true; 75436#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75890#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75889#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75888#L36 assume true; 75887#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 75886#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 75884#L35 assume true; 75885#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 75880#L36 assume true; 75879#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75877#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75876#L36 assume true; 75875#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75874#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75873#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75872#L36 assume true; 75871#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75870#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75869#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75868#L36 assume true; 75867#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75866#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75865#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75864#L36 assume true; 75863#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75861#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75860#L36 assume true; 75859#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75858#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75857#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75856#L36 assume true; 75855#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75854#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75853#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75852#L36 assume true; 75851#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75850#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75849#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75848#L36 assume true; 75847#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75846#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75845#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75844#L36 assume true; 75843#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 75842#L18 assume !(0 == __VERIFIER_assert_~cond#1); 75841#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 75840#L36 assume true; 74665#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 74674#L18 assume !(0 == __VERIFIER_assert_~cond#1); 74670#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 74664#L36 assume true; 74658#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 74636#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 74637#L35 assume true; 74648#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 74645#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 74646#L34 assume true; 74656#L34-2 [2024-11-17 08:34:59,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:59,896 INFO L85 PathProgramCache]: Analyzing trace with hash -39608154, now seen corresponding path program 21 times [2024-11-17 08:34:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:59,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496692352] [2024-11-17 08:34:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1617 proven. 367 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-17 08:35:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496692352] [2024-11-17 08:35:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496692352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903508204] [2024-11-17 08:35:00,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:35:00,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:00,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:00,180 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:00,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2024-11-17 08:35:00,315 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-17 08:35:00,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:35:00,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:35:00,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 2004 proven. 50 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-17 08:35:00,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1324 proven. 730 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-17 08:35:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903508204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:00,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 29 [2024-11-17 08:35:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866482357] [2024-11-17 08:35:00,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:00,929 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:35:00,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -48802078, now seen corresponding path program 19 times [2024-11-17 08:35:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077879120] [2024-11-17 08:35:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5587 backedges. 3528 proven. 922 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-11-17 08:35:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077879120] [2024-11-17 08:35:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077879120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905924846] [2024-11-17 08:35:01,454 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:35:01,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:01,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:01,456 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:01,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2024-11-17 08:35:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:01,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:35:01,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5587 backedges. 3154 proven. 1272 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2024-11-17 08:35:01,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5587 backedges. 3154 proven. 1272 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2024-11-17 08:35:02,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905924846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:02,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 22 [2024-11-17 08:35:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246552988] [2024-11-17 08:35:02,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:02,123 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:35:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:35:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 08:35:02,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2024-11-17 08:35:02,124 INFO L87 Difference]: Start difference. First operand 1511 states and 1587 transitions. cyclomatic complexity: 88 Second operand has 29 states, 29 states have (on average 4.931034482758621) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:35:03,358 INFO L93 Difference]: Finished difference Result 1317 states and 1371 transitions. [2024-11-17 08:35:03,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1317 states and 1371 transitions. [2024-11-17 08:35:03,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2024-11-17 08:35:03,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1317 states to 1166 states and 1220 transitions. [2024-11-17 08:35:03,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-17 08:35:03,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-17 08:35:03,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1166 states and 1220 transitions. [2024-11-17 08:35:03,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:35:03,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1166 states and 1220 transitions. [2024-11-17 08:35:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states and 1220 transitions. [2024-11-17 08:35:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1122. [2024-11-17 08:35:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1122 states have (on average 1.0472370766488412) internal successors, (1175), 1121 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1175 transitions. [2024-11-17 08:35:03,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1122 states and 1175 transitions. [2024-11-17 08:35:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 08:35:03,374 INFO L425 stractBuchiCegarLoop]: Abstraction has 1122 states and 1175 transitions. [2024-11-17 08:35:03,374 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-17 08:35:03,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1122 states and 1175 transitions. [2024-11-17 08:35:03,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2024-11-17 08:35:03,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:35:03,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:35:03,379 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 40, 40, 40, 15, 10, 10, 10, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-17 08:35:03,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 50, 50, 50, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-17 08:35:03,379 INFO L745 eck$LassoCheckResult]: Stem: 80220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 80221#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 80233#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 80234#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 80222#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 80223#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 80224#L34 assume true; 80272#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80268#L35 assume true; 80248#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80243#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80241#L34 assume true; 80229#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80230#L35 assume true; 80555#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80556#L36 assume true; 80547#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80548#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80539#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80540#L36 assume true; 80530#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80531#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80520#L35 assume true; 80521#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80510#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80511#L34 assume true; 80579#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80578#L35 assume true; 80577#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80576#L36 assume true; 80575#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80574#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80573#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80572#L36 assume true; 80571#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80570#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80569#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80568#L36 assume true; 80567#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80566#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80565#L35 assume true; 80564#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80563#L36 assume true; 80562#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80561#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80560#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80559#L36 assume true; 80558#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80557#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80554#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80550#L36 assume true; 80551#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80544#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80545#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80535#L36 assume true; 80536#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80525#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80526#L35 assume true; 80515#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80516#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80242#L34 assume true; 80231#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80232#L35 assume true; 81282#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81280#L36 assume true; 81278#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81276#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81274#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81272#L36 assume true; 81270#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81268#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81266#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81264#L36 assume true; 81262#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81260#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81258#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81256#L36 assume true; 81254#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 81252#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81250#L35 assume true; 81248#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81247#L36 assume true; 81245#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81243#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81241#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81239#L36 assume true; 81237#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81235#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81233#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81231#L36 assume true; 81229#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81227#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81225#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81223#L36 assume true; 81221#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81219#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81217#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81215#L36 assume true; 81213#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 81211#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81209#L35 assume true; 81207#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81204#L36 assume true; 81202#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81200#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81198#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81196#L36 assume true; 81194#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81192#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81190#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81188#L36 assume true; 81186#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81184#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81182#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81180#L36 assume true; 81178#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81176#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81175#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81169#L36 assume true; 81170#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81165#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81166#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80532#L36 assume true; 80527#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80522#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80517#L35 assume true; 80512#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80244#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80245#L34 assume true; 80466#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80465#L35 assume true; 80464#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80463#L36 assume true; 80462#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80461#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80460#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80459#L36 assume true; 80458#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80456#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80455#L36 assume true; 80454#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80452#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80451#L36 assume true; 80450#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80448#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80447#L36 assume true; 80446#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80445#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80444#L35 assume true; 80443#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80442#L36 assume true; 80441#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80440#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80439#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80438#L36 assume true; 80437#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80435#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80434#L36 assume true; 80433#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80432#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80431#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80430#L36 assume true; 80429#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80428#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80427#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80426#L36 assume true; 80425#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80424#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80423#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80422#L36 assume true; 80421#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80420#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80419#L35 assume true; 80418#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80417#L36 assume true; 80416#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80415#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80414#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80413#L36 assume true; 80412#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80410#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80409#L36 assume true; 80408#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80407#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80406#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80405#L36 assume true; 80404#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80403#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80402#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80401#L36 assume true; 80400#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80399#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80398#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80397#L36 assume true; 80396#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80395#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80394#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80392#L36 assume true; 80391#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80390#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80389#L35 assume true; 80388#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80386#L36 assume true; 80385#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80384#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80383#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80382#L36 assume true; 80381#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80379#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80378#L36 assume true; 80377#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80376#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80375#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80374#L36 assume true; 80373#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80372#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80371#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80370#L36 assume true; 80369#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80368#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80367#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80366#L36 assume true; 80365#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80361#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80359#L36 assume true; 80356#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80352#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80347#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80348#L36 assume true; 80302#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80282#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80280#L35 assume true; 80277#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80275#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80276#L34 assume true; 80260#L34-2 [2024-11-17 08:35:03,380 INFO L747 eck$LassoCheckResult]: Loop: 80260#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 80257#L35 assume true; 80255#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80225#L36 assume true; 80226#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80300#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80299#L36 assume true; 80298#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80297#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80296#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80295#L36 assume true; 80294#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80292#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80291#L36 assume true; 80290#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80289#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80288#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80287#L36 assume true; 80286#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80285#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80284#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80283#L36 assume true; 80281#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80279#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80269#L36 assume true; 80271#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 81158#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81156#L35 assume true; 81154#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81152#L36 assume true; 81151#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81149#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81148#L36 assume true; 81147#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81145#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81144#L36 assume true; 81143#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81142#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81141#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81140#L36 assume true; 81139#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81138#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81137#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81136#L36 assume true; 81135#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81134#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81133#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81132#L36 assume true; 81131#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81130#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81129#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81128#L36 assume true; 80822#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81127#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81126#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81125#L36 assume true; 81124#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 81123#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81122#L35 assume true; 81121#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81120#L36 assume true; 81119#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81118#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81117#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81116#L36 assume true; 81115#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81114#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81113#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81112#L36 assume true; 81111#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81110#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81109#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81108#L36 assume true; 81107#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81106#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81105#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81104#L36 assume true; 81103#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81102#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81101#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81100#L36 assume true; 81098#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81097#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81096#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81095#L36 assume true; 81093#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81090#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81089#L36 assume true; 80780#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81087#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81085#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81084#L36 assume true; 81083#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 81082#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81081#L35 assume true; 81080#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81079#L36 assume true; 81078#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81076#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81072#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81071#L36 assume true; 81070#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81068#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81066#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81064#L36 assume true; 81062#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81060#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81058#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81056#L36 assume true; 81054#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81052#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81050#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81049#L36 assume true; 81048#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81044#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81043#L36 assume true; 81041#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81039#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81037#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81036#L36 assume true; 81035#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81034#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81033#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81032#L36 assume true; 80738#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81031#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81030#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81022#L36 assume true; 81020#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 81019#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81018#L35 assume true; 81017#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 81016#L36 assume true; 81015#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81014#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81013#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81012#L36 assume true; 81011#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81009#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81008#L36 assume true; 81007#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81006#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81005#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81004#L36 assume true; 81003#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 81002#L18 assume !(0 == __VERIFIER_assert_~cond#1); 81001#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 81000#L36 assume true; 80999#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80998#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80997#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80996#L36 assume true; 80995#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80994#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80993#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80992#L36 assume true; 80991#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80990#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80989#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80988#L36 assume true; 80987#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80986#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80985#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80595#L36 assume true; 80596#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80588#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80584#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80585#L36 assume true; 80542#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80549#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80546#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80541#L36 assume true; 80543#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80357#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80358#L35 assume true; 80350#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 80351#L36 assume true; 80344#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80343#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80342#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80341#L36 assume true; 80340#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80339#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80338#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80337#L36 assume true; 80336#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80335#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80334#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80333#L36 assume true; 80332#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80331#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80330#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80329#L36 assume true; 80328#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80327#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80326#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80325#L36 assume true; 80324#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80323#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80322#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80321#L36 assume true; 80320#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80319#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80318#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80317#L36 assume true; 80316#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80315#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80314#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80313#L36 assume true; 80312#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80311#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80310#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80309#L36 assume true; 80308#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80307#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80306#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80267#L36 assume true; 80259#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80265#L18 assume !(0 == __VERIFIER_assert_~cond#1); 80261#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 80258#L36 assume true; 80256#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 80237#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 80238#L35 assume true; 80254#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 80266#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 80264#L34 assume true; 80260#L34-2 [2024-11-17 08:35:03,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1614872544, now seen corresponding path program 22 times [2024-11-17 08:35:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:03,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559447259] [2024-11-17 08:35:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:35:03,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:35:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:35:03,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:35:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -48802078, now seen corresponding path program 20 times [2024-11-17 08:35:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:03,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850540218] [2024-11-17 08:35:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5587 backedges. 3528 proven. 922 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-11-17 08:35:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850540218] [2024-11-17 08:35:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850540218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521512635] [2024-11-17 08:35:03,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:35:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:03,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:03,939 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:03,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-11-17 08:35:04,105 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:35:04,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:35:04,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:35:04,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5587 backedges. 3154 proven. 1272 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2024-11-17 08:35:04,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5587 backedges. 3154 proven. 1272 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2024-11-17 08:35:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521512635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:04,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 22 [2024-11-17 08:35:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224925926] [2024-11-17 08:35:04,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:04,545 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:35:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:35:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 08:35:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-11-17 08:35:04,546 INFO L87 Difference]: Start difference. First operand 1122 states and 1175 transitions. cyclomatic complexity: 59 Second operand has 22 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:35:05,106 INFO L93 Difference]: Finished difference Result 1454 states and 1521 transitions. [2024-11-17 08:35:05,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1454 states and 1521 transitions. [2024-11-17 08:35:05,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 329 [2024-11-17 08:35:05,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1454 states to 1450 states and 1516 transitions. [2024-11-17 08:35:05,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-17 08:35:05,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-17 08:35:05,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1450 states and 1516 transitions. [2024-11-17 08:35:05,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:35:05,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1450 states and 1516 transitions. [2024-11-17 08:35:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states and 1516 transitions. [2024-11-17 08:35:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1073. [2024-11-17 08:35:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1073 states have (on average 1.0438024231127678) internal successors, (1120), 1072 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1120 transitions. [2024-11-17 08:35:05,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1073 states and 1120 transitions. [2024-11-17 08:35:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-17 08:35:05,123 INFO L425 stractBuchiCegarLoop]: Abstraction has 1073 states and 1120 transitions. [2024-11-17 08:35:05,123 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-17 08:35:05,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1073 states and 1120 transitions. [2024-11-17 08:35:05,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2024-11-17 08:35:05,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:35:05,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:35:05,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 40, 40, 40, 15, 10, 10, 10, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-17 08:35:05,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [57, 51, 51, 51, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-17 08:35:05,131 INFO L745 eck$LassoCheckResult]: Stem: 84293#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 84294#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 84306#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 84307#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 84295#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 84296#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 84297#L34 assume true; 84337#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 84336#L35 assume true; 84335#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 84316#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 84314#L34 assume true; 84302#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 84303#L35 assume true; 84542#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84543#L36 assume true; 84533#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84534#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84525#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84526#L36 assume true; 84517#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84518#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84510#L35 assume true; 84511#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 84317#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 84318#L34 assume true; 84566#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 84565#L35 assume true; 84564#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84563#L36 assume true; 84562#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84561#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84560#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84559#L36 assume true; 84558#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84557#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84556#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84555#L36 assume true; 84554#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84553#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84552#L35 assume true; 84551#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84550#L36 assume true; 84549#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84548#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84547#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84546#L36 assume true; 84545#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84544#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84541#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84537#L36 assume true; 84538#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84529#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84530#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84521#L36 assume true; 84522#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84513#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84514#L35 assume true; 84346#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 84347#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 84315#L34 assume true; 84304#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 84305#L35 assume true; 85261#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 85260#L36 assume true; 85259#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85258#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85257#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85256#L36 assume true; 85255#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85254#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85253#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85252#L36 assume true; 85251#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85250#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85249#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85248#L36 assume true; 85247#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 85246#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 85245#L35 assume true; 85244#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 85243#L36 assume true; 85242#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85241#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85240#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85239#L36 assume true; 85238#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85237#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85236#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85235#L36 assume true; 85234#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85233#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85232#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85231#L36 assume true; 85230#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85229#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85228#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85227#L36 assume true; 85226#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 85225#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 85224#L35 assume true; 85223#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 85221#L36 assume true; 85220#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85219#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85218#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85217#L36 assume true; 85216#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85215#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85214#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85213#L36 assume true; 85212#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85211#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85210#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85209#L36 assume true; 85208#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85206#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85204#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85203#L36 assume true; 85202#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85194#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85195#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84635#L36 assume true; 84632#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84629#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84626#L35 assume true; 84505#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 84504#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 84503#L34 assume true; 84502#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 84501#L35 assume true; 84500#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84499#L36 assume true; 84498#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84497#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84496#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84495#L36 assume true; 84494#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84493#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84492#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84491#L36 assume true; 84490#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84489#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84488#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84487#L36 assume true; 84486#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84485#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84484#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84483#L36 assume true; 84482#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84481#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84480#L35 assume true; 84479#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84478#L36 assume true; 84477#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84476#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84475#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84474#L36 assume true; 84473#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84472#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84471#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84470#L36 assume true; 84469#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84468#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84467#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84466#L36 assume true; 84465#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84464#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84463#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84462#L36 assume true; 84461#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84459#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84458#L36 assume true; 84457#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84456#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84455#L35 assume true; 84454#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84453#L36 assume true; 84452#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84451#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84450#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84449#L36 assume true; 84448#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84447#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84446#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84445#L36 assume true; 84444#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84443#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84442#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84441#L36 assume true; 84440#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84439#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84438#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84437#L36 assume true; 84436#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84435#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84434#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84433#L36 assume true; 84432#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84431#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84430#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84428#L36 assume true; 84427#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84426#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84425#L35 assume true; 84424#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84422#L36 assume true; 84421#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84419#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84418#L36 assume true; 84417#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84416#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84415#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84414#L36 assume true; 84413#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84412#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84411#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84410#L36 assume true; 84409#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84408#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84407#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84406#L36 assume true; 84405#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84404#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84403#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84402#L36 assume true; 84401#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84400#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84397#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84395#L36 assume true; 84393#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84391#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84388#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84389#L36 assume true; 84360#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84506#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84342#L35 assume true; 84343#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 84338#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 84339#L34 assume true; 84331#L34-2 [2024-11-17 08:35:05,131 INFO L747 eck$LassoCheckResult]: Loop: 84331#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 84330#L35 assume true; 84329#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84298#L36 assume true; 84299#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84380#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84379#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84378#L36 assume true; 84377#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84376#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84375#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84374#L36 assume true; 84373#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84372#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84371#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84370#L36 assume true; 84369#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84368#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84367#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84366#L36 assume true; 84365#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84364#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84363#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84361#L36 assume true; 84362#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84355#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84356#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84350#L36 assume true; 84351#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 85156#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 85155#L35 assume true; 85154#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 85153#L36 assume true; 85152#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85151#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85150#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85149#L36 assume true; 85148#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85147#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85146#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85145#L36 assume true; 85144#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85143#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85142#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85141#L36 assume true; 85140#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85139#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85138#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85137#L36 assume true; 85136#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85135#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85134#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85133#L36 assume true; 85132#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85131#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85130#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85129#L36 assume true; 84859#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85123#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85121#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85119#L36 assume true; 85117#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 85115#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 85113#L35 assume true; 85111#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 85109#L36 assume true; 85108#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85107#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85106#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85105#L36 assume true; 85104#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85103#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85102#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85101#L36 assume true; 85100#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85099#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85098#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85097#L36 assume true; 85096#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85095#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85094#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85093#L36 assume true; 85092#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85090#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85089#L36 assume true; 85088#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85087#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85086#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85085#L36 assume true; 85084#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85083#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85082#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85081#L36 assume true; 84817#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85044#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85042#L36 assume true; 85040#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 85039#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 85038#L35 assume true; 85037#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 85036#L36 assume true; 85035#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85034#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85033#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85032#L36 assume true; 85031#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85030#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85029#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85028#L36 assume true; 85027#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85026#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85025#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85024#L36 assume true; 85023#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85022#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85021#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85020#L36 assume true; 85019#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85018#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85017#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85016#L36 assume true; 85015#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85014#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85013#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85012#L36 assume true; 85011#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85010#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85009#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85008#L36 assume true; 85007#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85006#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85005#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 85004#L36 assume true; 84775#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 85002#L18 assume !(0 == __VERIFIER_assert_~cond#1); 85001#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84986#L36 assume true; 84645#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84984#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84985#L35 assume true; 84981#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84980#L36 assume true; 84625#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84976#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84977#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84972#L36 assume true; 84973#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84968#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84969#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84964#L36 assume true; 84965#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84960#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84961#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84956#L36 assume true; 84957#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84952#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84953#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84948#L36 assume true; 84949#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84944#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84945#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84940#L36 assume true; 84941#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84936#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84937#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84932#L36 assume true; 84933#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84928#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84929#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84924#L36 assume true; 84925#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84657#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84658#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84650#L36 assume true; 84649#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84648#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84647#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84644#L36 assume true; 84641#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84643#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84642#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84640#L36 assume true; 84637#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84634#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84631#L35 assume true; 84628#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 84624#L36 assume true; 84623#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84622#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84621#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84618#L36 assume true; 84616#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84614#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84612#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84610#L36 assume true; 84608#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84606#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84604#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84602#L36 assume true; 84600#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84598#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84596#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84594#L36 assume true; 84592#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84590#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84588#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84586#L36 assume true; 84584#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84582#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84580#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84578#L36 assume true; 84576#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84574#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84572#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84570#L36 assume true; 84568#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84539#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84535#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84531#L36 assume true; 84527#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84523#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84519#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84515#L36 assume true; 84394#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84392#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84390#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84386#L36 assume true; 84382#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84384#L18 assume !(0 == __VERIFIER_assert_~cond#1); 84383#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 84381#L36 assume true; 84348#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 84310#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 84311#L35 assume true; 84320#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 84321#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 84334#L34 assume true; 84331#L34-2 [2024-11-17 08:35:05,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1614872544, now seen corresponding path program 23 times [2024-11-17 08:35:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:05,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183068686] [2024-11-17 08:35:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:35:05,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:35:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:35:05,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:35:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 293967882, now seen corresponding path program 21 times [2024-11-17 08:35:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544693417] [2024-11-17 08:35:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:35:05,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:35:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:35:05,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:35:05,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash 872323595, now seen corresponding path program 24 times [2024-11-17 08:35:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:05,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675550620] [2024-11-17 08:35:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 20165 backedges. 10165 proven. 3767 refuted. 0 times theorem prover too weak. 6233 trivial. 0 not checked. [2024-11-17 08:35:05,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:05,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675550620] [2024-11-17 08:35:05,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675550620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:05,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109989432] [2024-11-17 08:35:05,886 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:35:05,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:05,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:05,888 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:05,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2024-11-17 08:35:06,127 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2024-11-17 08:35:06,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:35:06,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 08:35:06,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20165 backedges. 9868 proven. 5339 refuted. 0 times theorem prover too weak. 4958 trivial. 0 not checked. [2024-11-17 08:35:06,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20165 backedges. 9868 proven. 5339 refuted. 0 times theorem prover too weak. 4958 trivial. 0 not checked. [2024-11-17 08:35:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109989432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:07,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 27 [2024-11-17 08:35:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521528064] [2024-11-17 08:35:07,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:12,080 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:35:12,081 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:35:12,081 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:35:12,081 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:35:12,081 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:35:12,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:35:12,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:35:12,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration26_Loop [2024-11-17 08:35:12,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:35:12,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:35:12,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,133 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:35:12,134 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:35:12,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:12,136 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:35:12,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-17 08:35:12,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:35:12,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:35:12,153 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:35:12,154 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:35:12,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-17 08:35:12,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:12,170 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:35:12,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-17 08:35:12,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:35:12,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:35:12,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-17 08:35:12,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:12,211 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:35:12,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-17 08:35:12,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:35:12,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:35:12,228 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:35:12,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-17 08:35:12,243 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:35:12,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:35:12,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:35:12,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:35:12,243 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:35:12,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:35:12,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:35:12,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration26_Loop [2024-11-17 08:35:12,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:35:12,243 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:35:12,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:35:12,310 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:35:12,310 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:35:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:12,313 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:35:12,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-17 08:35:12,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:35:12,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:35:12,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:35:12,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:35:12,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:35:12,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:35:12,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:35:12,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:35:12,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:35:12,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-17 08:35:12,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:12,345 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:35:12,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:35:12,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-17 08:35:12,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:35:12,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:35:12,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:35:12,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:35:12,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:35:12,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:35:12,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:35:12,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:35:12,366 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:35:12,366 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:35:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:35:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:12,368 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:35:12,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-17 08:35:12,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:35:12,370 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:35:12,370 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:35:12,371 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 13 Supporting invariants [] [2024-11-17 08:35:12,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-11-17 08:35:12,386 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:35:12,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:12,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:35:12,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:12,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-17 08:35:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:12,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:35:12,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 0 proven. 1324 refuted. 0 times theorem prover too weak. 4475 trivial. 0 not checked. [2024-11-17 08:35:13,480 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2024-11-17 08:35:13,480 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1073 states and 1120 transitions. cyclomatic complexity: 52 Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:13,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1073 states and 1120 transitions. cyclomatic complexity: 52. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2503 states and 2610 transitions. Complement of second has 38 states. [2024-11-17 08:35:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2024-11-17 08:35:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2024-11-17 08:35:13,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 97 transitions. Stem has 242 letters. Loop has 239 letters. [2024-11-17 08:35:13,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:35:13,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 97 transitions. Stem has 481 letters. Loop has 239 letters. [2024-11-17 08:35:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:35:13,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 97 transitions. Stem has 242 letters. Loop has 478 letters. [2024-11-17 08:35:13,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:35:13,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2503 states and 2610 transitions. [2024-11-17 08:35:13,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 254 [2024-11-17 08:35:13,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2503 states to 1513 states and 1577 transitions. [2024-11-17 08:35:13,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:35:13,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-17 08:35:13,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1513 states and 1577 transitions. [2024-11-17 08:35:13,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:35:13,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1513 states and 1577 transitions. [2024-11-17 08:35:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states and 1577 transitions. [2024-11-17 08:35:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-17 08:35:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1498 states have (on average 1.0427236315086783) internal successors, (1562), 1497 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1562 transitions. [2024-11-17 08:35:13,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1498 states and 1562 transitions. [2024-11-17 08:35:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:35:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-17 08:35:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2024-11-17 08:35:13,846 INFO L87 Difference]: Start difference. First operand 1498 states and 1562 transitions. Second operand has 27 states, 27 states have (on average 5.62962962962963) internal successors, (152), 27 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:35:14,947 INFO L93 Difference]: Finished difference Result 2427 states and 2531 transitions. [2024-11-17 08:35:14,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2427 states and 2531 transitions. [2024-11-17 08:35:14,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2024-11-17 08:35:14,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2427 states to 2167 states and 2257 transitions. [2024-11-17 08:35:14,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:35:14,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:35:14,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2167 states and 2257 transitions. [2024-11-17 08:35:14,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:35:14,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2167 states and 2257 transitions. [2024-11-17 08:35:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states and 2257 transitions. [2024-11-17 08:35:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1697. [2024-11-17 08:35:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1697 states have (on average 1.0388921626399528) internal successors, (1763), 1696 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1763 transitions. [2024-11-17 08:35:14,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1697 states and 1763 transitions. [2024-11-17 08:35:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-17 08:35:14,973 INFO L425 stractBuchiCegarLoop]: Abstraction has 1697 states and 1763 transitions. [2024-11-17 08:35:14,973 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-17 08:35:14,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1697 states and 1763 transitions. [2024-11-17 08:35:14,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2024-11-17 08:35:14,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:35:14,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:35:14,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [76, 62, 62, 62, 20, 14, 14, 14, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-17 08:35:14,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 54, 54, 54, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-17 08:35:14,979 INFO L745 eck$LassoCheckResult]: Stem: 96365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 96366#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 96378#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 96379#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 96367#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 96368#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 96369#L34 assume true; 96374#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 96375#L35 assume true; 97135#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 97132#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 97129#L34 assume true; 97126#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 97123#L35 assume true; 97120#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97117#L36 assume true; 97115#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97111#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97108#L36 assume true; 97107#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 97105#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 97103#L35 assume true; 97100#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 97098#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 97096#L34 assume true; 97094#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 97092#L35 assume true; 97090#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97088#L36 assume true; 97086#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97084#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97082#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97080#L36 assume true; 97078#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97076#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97074#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97072#L36 assume true; 97070#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 97068#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 97066#L35 assume true; 97064#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97062#L36 assume true; 97060#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97056#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97054#L36 assume true; 97052#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97048#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97046#L36 assume true; 97044#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97040#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97038#L36 assume true; 97036#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 97034#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 97033#L35 assume true; 97031#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 97029#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 97026#L34 assume true; 97024#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 97022#L35 assume true; 97020#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97018#L36 assume true; 97016#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97014#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97012#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97010#L36 assume true; 97008#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97006#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97004#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97002#L36 assume true; 97000#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96998#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96996#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96994#L36 assume true; 96992#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96990#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96988#L35 assume true; 96986#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96984#L36 assume true; 96982#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96980#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96978#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96976#L36 assume true; 96974#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96972#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96970#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96968#L36 assume true; 96966#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96964#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96962#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96960#L36 assume true; 96958#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96956#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96954#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96952#L36 assume true; 96951#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96949#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96947#L35 assume true; 96944#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96942#L36 assume true; 96940#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96938#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96936#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96934#L36 assume true; 96932#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96930#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96928#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96926#L36 assume true; 96924#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96922#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96920#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96918#L36 assume true; 96916#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96914#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96912#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96910#L36 assume true; 96908#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96906#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96904#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96902#L36 assume true; 96900#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96898#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96896#L35 assume true; 96894#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 96892#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96890#L34 assume true; 96888#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 96886#L35 assume true; 96884#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96882#L36 assume true; 96880#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96878#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96876#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96874#L36 assume true; 96872#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96870#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96869#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96867#L36 assume true; 96865#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96862#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96861#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96859#L36 assume true; 96857#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96855#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96853#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96852#L36 assume true; 96850#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96848#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96846#L35 assume true; 96844#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96842#L36 assume true; 96840#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96838#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96836#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96834#L36 assume true; 96832#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96830#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96828#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96826#L36 assume true; 96824#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96822#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96820#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96818#L36 assume true; 96816#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96814#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96812#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96810#L36 assume true; 96808#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96806#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96804#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96802#L36 assume true; 96800#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96798#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96796#L35 assume true; 96794#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96792#L36 assume true; 96790#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96788#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96786#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96784#L36 assume true; 96781#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96780#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96778#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96776#L36 assume true; 96773#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96771#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96769#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96767#L36 assume true; 96765#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96762#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96760#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96758#L36 assume true; 96756#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96754#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96752#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96750#L36 assume true; 96748#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96746#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96744#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96742#L36 assume true; 96740#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96738#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96736#L35 assume true; 96734#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96731#L36 assume true; 96729#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96727#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96725#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96723#L36 assume true; 96721#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96719#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96717#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96715#L36 assume true; 96713#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96711#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96709#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96707#L36 assume true; 96705#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96703#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96701#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96699#L36 assume true; 96697#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96695#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96693#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96691#L36 assume true; 96689#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96687#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96683#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96684#L36 assume true; 96674#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96675#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96670#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96671#L36 assume true; 96657#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96658#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96653#L35 assume true; 96654#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 96389#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96390#L34 assume true; 97364#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 97363#L35 assume true; 97362#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97361#L36 assume true; 97360#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97359#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97358#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97357#L36 assume true; 97356#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97355#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97354#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97353#L36 assume true; 97352#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97351#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97350#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97349#L36 assume true; 97348#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97347#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97346#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97345#L36 assume true; 97344#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 97343#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 97342#L35 assume true; 97341#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97340#L36 assume true; 97339#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97338#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97337#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97336#L36 assume true; 97335#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97334#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97333#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97332#L36 assume true; 97331#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97330#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97329#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97328#L36 assume true; 97327#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97326#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97325#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97324#L36 assume true; 97323#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97322#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97321#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97320#L36 assume true; 97319#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 97318#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 97317#L35 assume true; 97316#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97315#L36 assume true; 97314#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97313#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97312#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97311#L36 assume true; 97310#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97309#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97308#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97307#L36 assume true; 97306#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97305#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97304#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97303#L36 assume true; 97302#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97301#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97300#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97299#L36 assume true; 97298#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97297#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97296#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97295#L36 assume true; 97294#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97293#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97292#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97290#L36 assume true; 97289#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 97288#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 97287#L35 assume true; 97286#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 97284#L36 assume true; 97283#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97282#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97281#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97280#L36 assume true; 97279#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97278#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97277#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97276#L36 assume true; 97275#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97274#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97273#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97272#L36 assume true; 97271#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97270#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97269#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97268#L36 assume true; 97267#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97266#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97265#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97264#L36 assume true; 97263#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97262#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97261#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97259#L36 assume true; 97256#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 97257#L18 assume !(0 == __VERIFIER_assert_~cond#1); 97250#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 97251#L36 assume true; 96648#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96646#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96647#L35 assume true; 97365#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 96641#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96642#L34 assume true; 96405#L34-2 [2024-11-17 08:35:14,980 INFO L747 eck$LassoCheckResult]: Loop: 96405#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 96399#L35 assume true; 96397#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96370#L36 assume true; 96371#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96455#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96453#L36 assume true; 96451#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96447#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96445#L36 assume true; 96443#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96441#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96439#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96437#L36 assume true; 96435#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96433#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96431#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96429#L36 assume true; 96427#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96425#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96423#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96421#L36 assume true; 96419#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96417#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96415#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96413#L36 assume true; 96401#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96410#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96407#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96400#L36 assume true; 96395#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96396#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96640#L35 assume true; 96639#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96638#L36 assume true; 96637#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96636#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96635#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96634#L36 assume true; 96633#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96632#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96631#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96630#L36 assume true; 96629#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96628#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96627#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96626#L36 assume true; 96625#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96624#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96623#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96622#L36 assume true; 96621#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96620#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96619#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96618#L36 assume true; 96617#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96616#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96615#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96614#L36 assume true; 96613#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96612#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96611#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96610#L36 assume true; 96607#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96609#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96608#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96606#L36 assume true; 96605#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96604#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96603#L35 assume true; 96602#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96601#L36 assume true; 96600#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96599#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96598#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96597#L36 assume true; 96596#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96595#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96594#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96593#L36 assume true; 96592#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96591#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96590#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96589#L36 assume true; 96588#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96587#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96586#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96585#L36 assume true; 96584#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96583#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96582#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96581#L36 assume true; 96580#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96579#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96578#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96577#L36 assume true; 96576#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96575#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96574#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96573#L36 assume true; 96572#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96571#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96570#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96569#L36 assume true; 96566#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96568#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96567#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96565#L36 assume true; 96564#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96563#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96562#L35 assume true; 96561#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96560#L36 assume true; 96559#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96558#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96557#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96556#L36 assume true; 96555#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96554#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96553#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96552#L36 assume true; 96551#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96550#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96549#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96548#L36 assume true; 96547#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96546#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96545#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96544#L36 assume true; 96543#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96542#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96541#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96540#L36 assume true; 96539#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96538#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96537#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96536#L36 assume true; 96535#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96534#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96533#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96532#L36 assume true; 96531#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96530#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96529#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96528#L36 assume true; 96525#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96527#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96526#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96524#L36 assume true; 96485#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96523#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96522#L35 assume true; 96521#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96520#L36 assume true; 96475#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96519#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96518#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96517#L36 assume true; 96516#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96515#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96514#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96513#L36 assume true; 96512#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96511#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96510#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96509#L36 assume true; 96508#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96507#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96506#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96505#L36 assume true; 96504#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96503#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96502#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96501#L36 assume true; 96500#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96499#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96498#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96497#L36 assume true; 96496#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96495#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96494#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96493#L36 assume true; 96492#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96491#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96490#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96489#L36 assume true; 96488#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96487#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96486#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96484#L36 assume true; 96481#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96483#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96482#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96480#L36 assume true; 96479#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96478#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96477#L35 assume true; 96476#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 96474#L36 assume true; 96473#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96472#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96471#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96470#L36 assume true; 96469#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96468#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96467#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96466#L36 assume true; 96465#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96464#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96463#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96462#L36 assume true; 96461#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96460#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96459#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96458#L36 assume true; 96456#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96454#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96452#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96450#L36 assume true; 96448#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96446#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96444#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96442#L36 assume true; 96440#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96438#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96436#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96434#L36 assume true; 96432#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96430#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96428#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96426#L36 assume true; 96424#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96422#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96420#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96418#L36 assume true; 96416#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96414#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96412#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96411#L36 assume true; 96403#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 96406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 96404#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 96402#L36 assume true; 96398#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 96382#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 96383#L35 assume true; 96392#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 96387#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96388#L34 assume true; 96405#L34-2 [2024-11-17 08:35:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1234875235, now seen corresponding path program 25 times [2024-11-17 08:35:14,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:14,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978717775] [2024-11-17 08:35:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 6768 proven. 924 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-17 08:35:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978717775] [2024-11-17 08:35:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978717775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984472441] [2024-11-17 08:35:15,445 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:35:15,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:15,448 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:15,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2024-11-17 08:35:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:15,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 08:35:15,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 6840 proven. 852 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-17 08:35:16,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 6810 proven. 882 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-17 08:35:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984472441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:16,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-17 08:35:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734071762] [2024-11-17 08:35:16,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:16,382 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:35:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 20384482, now seen corresponding path program 22 times [2024-11-17 08:35:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767047772] [2024-11-17 08:35:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6459 backedges. 3604 proven. 1630 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-17 08:35:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767047772] [2024-11-17 08:35:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767047772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192865409] [2024-11-17 08:35:16,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:35:16,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:16,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:16,875 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:16,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2024-11-17 08:35:17,048 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:35:17,048 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:35:17,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 08:35:17,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6459 backedges. 3604 proven. 1630 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-17 08:35:17,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6459 backedges. 3604 proven. 1630 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-17 08:35:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192865409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:17,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:17,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2024-11-17 08:35:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740735096] [2024-11-17 08:35:17,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:17,562 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:35:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:35:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 08:35:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2024-11-17 08:35:17,563 INFO L87 Difference]: Start difference. First operand 1697 states and 1763 transitions. cyclomatic complexity: 73 Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:35:18,159 INFO L93 Difference]: Finished difference Result 2131 states and 2206 transitions. [2024-11-17 08:35:18,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2131 states and 2206 transitions. [2024-11-17 08:35:18,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260 [2024-11-17 08:35:18,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2131 states to 2011 states and 2084 transitions. [2024-11-17 08:35:18,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:35:18,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:35:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2011 states and 2084 transitions. [2024-11-17 08:35:18,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:35:18,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2011 states and 2084 transitions. [2024-11-17 08:35:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states and 2084 transitions. [2024-11-17 08:35:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1637. [2024-11-17 08:35:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1637 states have (on average 1.03787416004887) internal successors, (1699), 1636 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:35:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 1699 transitions. [2024-11-17 08:35:18,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1637 states and 1699 transitions. [2024-11-17 08:35:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-17 08:35:18,178 INFO L425 stractBuchiCegarLoop]: Abstraction has 1637 states and 1699 transitions. [2024-11-17 08:35:18,179 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-17 08:35:18,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1637 states and 1699 transitions. [2024-11-17 08:35:18,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2024-11-17 08:35:18,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:35:18,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:35:18,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [76, 62, 62, 62, 20, 14, 14, 14, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-17 08:35:18,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [61, 55, 55, 55, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-17 08:35:18,185 INFO L745 eck$LassoCheckResult]: Stem: 103938#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; 103939#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 103951#L30-1 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 103952#L31-1 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 103940#L32-1 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 103941#L33-1 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1;main_~i~0#1 := 0; 103942#L34 assume true; 103947#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 103948#L35 assume true; 104531#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 104530#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 104529#L34 assume true; 104528#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 104527#L35 assume true; 104526#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104525#L36 assume true; 104524#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104523#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104522#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104521#L36 assume true; 104520#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104519#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104518#L35 assume true; 104517#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 104516#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 104515#L34 assume true; 104514#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 104513#L35 assume true; 104512#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104511#L36 assume true; 104510#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104509#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104508#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104507#L36 assume true; 104506#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104505#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104504#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104503#L36 assume true; 104502#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104501#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104500#L35 assume true; 104499#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104498#L36 assume true; 104497#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104496#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104495#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104494#L36 assume true; 104493#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104492#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104491#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104490#L36 assume true; 104489#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104488#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104487#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104486#L36 assume true; 104485#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104484#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104483#L35 assume true; 104482#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 104481#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 104480#L34 assume true; 104479#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 104478#L35 assume true; 104477#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104476#L36 assume true; 104475#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104474#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104473#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104472#L36 assume true; 104471#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104470#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104469#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104468#L36 assume true; 104467#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104466#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104465#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104464#L36 assume true; 104463#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104462#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104461#L35 assume true; 104460#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104459#L36 assume true; 104458#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104457#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104456#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104455#L36 assume true; 104454#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104453#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104452#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104451#L36 assume true; 104450#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104448#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104447#L36 assume true; 104446#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104444#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104443#L36 assume true; 104442#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104441#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104440#L35 assume true; 104439#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104438#L36 assume true; 104437#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104436#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104435#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104434#L36 assume true; 104433#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104432#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104431#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104430#L36 assume true; 104429#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104428#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104427#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104426#L36 assume true; 104425#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104424#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104423#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104422#L36 assume true; 104421#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104420#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104419#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104418#L36 assume true; 104417#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104416#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104415#L35 assume true; 104414#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 104413#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 104412#L34 assume true; 104411#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 104410#L35 assume true; 104409#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104408#L36 assume true; 104407#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104406#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104405#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104404#L36 assume true; 104403#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104402#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104401#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104400#L36 assume true; 104399#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104398#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104397#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104396#L36 assume true; 104395#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104394#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104393#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104392#L36 assume true; 104391#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104390#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104389#L35 assume true; 104388#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104387#L36 assume true; 104386#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104385#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104384#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104383#L36 assume true; 104382#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104381#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104380#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104379#L36 assume true; 104378#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104377#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104376#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104375#L36 assume true; 104374#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104373#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104372#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104371#L36 assume true; 104370#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104369#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104368#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104367#L36 assume true; 104366#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104365#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104364#L35 assume true; 104363#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104362#L36 assume true; 104361#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104360#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104359#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104358#L36 assume true; 104357#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104355#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104353#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104350#L36 assume true; 104348#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104346#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104344#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104342#L36 assume true; 104339#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104337#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104335#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104333#L36 assume true; 104331#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104329#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104327#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104325#L36 assume true; 104323#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104321#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104319#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104317#L36 assume true; 104315#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104313#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104311#L35 assume true; 104309#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104307#L36 assume true; 104305#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104303#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104301#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104299#L36 assume true; 104297#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104295#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104293#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104291#L36 assume true; 104289#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104287#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104285#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104283#L36 assume true; 104281#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104279#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104277#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104275#L36 assume true; 104273#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104271#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104269#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104267#L36 assume true; 104265#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104263#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104260#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104261#L36 assume true; 104250#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104251#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104259#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104258#L36 assume true; 104245#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104897#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104895#L35 assume true; 104227#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 103962#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 103963#L34 assume true; 104893#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 104892#L35 assume true; 104891#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104890#L36 assume true; 104889#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104888#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104887#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104886#L36 assume true; 104885#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104884#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104883#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104882#L36 assume true; 104881#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104880#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104879#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104878#L36 assume true; 104877#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104876#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104875#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104874#L36 assume true; 104873#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104872#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104871#L35 assume true; 104870#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104869#L36 assume true; 104868#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104867#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104866#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104865#L36 assume true; 104864#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104863#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104862#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104861#L36 assume true; 104860#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104859#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104858#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104857#L36 assume true; 104856#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104855#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104854#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104853#L36 assume true; 104852#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104851#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104850#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104849#L36 assume true; 104848#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104847#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104846#L35 assume true; 104845#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104844#L36 assume true; 104843#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104842#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104841#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104840#L36 assume true; 104839#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104838#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104837#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104836#L36 assume true; 104835#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104834#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104833#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104832#L36 assume true; 104831#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104830#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104829#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104828#L36 assume true; 104827#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104826#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104825#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104824#L36 assume true; 104823#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104822#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104821#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104819#L36 assume true; 104818#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104817#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104816#L35 assume true; 104815#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104813#L36 assume true; 104812#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104811#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104810#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104809#L36 assume true; 104808#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104807#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104806#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104805#L36 assume true; 104804#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104803#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104802#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104801#L36 assume true; 104800#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104799#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104798#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104797#L36 assume true; 104796#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104795#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104794#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104793#L36 assume true; 104792#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104791#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104790#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104787#L36 assume true; 104788#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104783#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104784#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104789#L36 assume true; 104777#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104899#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104898#L35 assume true; 104896#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 104220#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 104221#L34 assume true; 103980#L34-2 [2024-11-17 08:35:18,186 INFO L747 eck$LassoCheckResult]: Loop: 103980#L34-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 103974#L35 assume true; 103972#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 103943#L36 assume true; 103944#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104058#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104057#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104056#L36 assume true; 104055#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104054#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104053#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104052#L36 assume true; 104051#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104049#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104048#L36 assume true; 104047#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104046#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104045#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104044#L36 assume true; 104043#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104042#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104041#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104040#L36 assume true; 104039#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104037#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104036#L36 assume true; 103976#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103985#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103982#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103975#L36 assume true; 103968#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 103969#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104219#L35 assume true; 104218#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104217#L36 assume true; 104216#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104215#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104214#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104213#L36 assume true; 104212#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104211#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104210#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104209#L36 assume true; 104208#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104207#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104206#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104205#L36 assume true; 104204#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104203#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104202#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104201#L36 assume true; 104200#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104199#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104198#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104197#L36 assume true; 104196#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104194#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104193#L36 assume true; 104192#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104191#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104190#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104189#L36 assume true; 104186#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104188#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104187#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104185#L36 assume true; 104184#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104183#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104182#L35 assume true; 104181#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104180#L36 assume true; 104179#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104178#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104177#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104176#L36 assume true; 104175#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104173#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104172#L36 assume true; 104171#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104169#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104168#L36 assume true; 104167#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104166#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104165#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104164#L36 assume true; 104163#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104162#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104161#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104160#L36 assume true; 104159#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104158#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104157#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104156#L36 assume true; 104155#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104154#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104153#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104152#L36 assume true; 104151#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104150#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104149#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104148#L36 assume true; 104145#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104147#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104146#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104144#L36 assume true; 104143#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104142#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104141#L35 assume true; 104140#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104139#L36 assume true; 104138#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104137#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104136#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104135#L36 assume true; 104134#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104133#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104132#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104131#L36 assume true; 104130#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104129#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104128#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104127#L36 assume true; 104126#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104125#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104124#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104123#L36 assume true; 104122#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104121#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104120#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104119#L36 assume true; 104118#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104117#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104116#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104115#L36 assume true; 104114#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104113#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104112#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104111#L36 assume true; 104110#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104109#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104108#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104107#L36 assume true; 104106#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104105#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104104#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104103#L36 assume true; 104100#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104102#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104101#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104099#L36 assume true; 104098#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104097#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104096#L35 assume true; 104095#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104094#L36 assume true; 104027#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104093#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104092#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104091#L36 assume true; 104090#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104089#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104088#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104087#L36 assume true; 104086#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104085#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104084#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104083#L36 assume true; 104082#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104081#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104080#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104079#L36 assume true; 104078#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104077#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104076#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104075#L36 assume true; 104074#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104073#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104072#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104071#L36 assume true; 104070#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104069#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104068#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104067#L36 assume true; 104066#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104065#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104064#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104063#L36 assume true; 104062#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104061#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104060#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104059#L36 assume true; 104033#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104035#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104034#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104032#L36 assume true; 104031#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 104030#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104029#L35 assume true; 104028#L35-2 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 104026#L36 assume true; 104025#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104024#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104023#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104022#L36 assume true; 104021#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104020#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104019#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104018#L36 assume true; 104017#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104016#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104015#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104014#L36 assume true; 104013#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104012#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104011#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104010#L36 assume true; 104009#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104008#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104007#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104006#L36 assume true; 104005#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104004#L18 assume !(0 == __VERIFIER_assert_~cond#1); 104003#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 104002#L36 assume true; 104001#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104000#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103999#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103998#L36 assume true; 103997#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103996#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103995#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103994#L36 assume true; 103993#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103992#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103991#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103990#L36 assume true; 103989#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103988#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103987#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103986#L36 assume true; 103978#L36-1 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 103981#L18 assume !(0 == __VERIFIER_assert_~cond#1); 103979#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 103977#L36 assume true; 103973#L36-1 assume !(main_~k~0#1 < main_~j~0#1); 103955#L35-1 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 103956#L35 assume true; 103965#L35-2 assume !(main_~j~0#1 < 3 * main_~i~0#1); 103960#L34-1 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 103961#L34 assume true; 103980#L34-2 [2024-11-17 08:35:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1234875235, now seen corresponding path program 26 times [2024-11-17 08:35:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:18,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756783278] [2024-11-17 08:35:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 6768 proven. 924 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-17 08:35:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756783278] [2024-11-17 08:35:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756783278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652014279] [2024-11-17 08:35:18,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:35:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:18,598 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:18,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2024-11-17 08:35:18,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:35:18,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:35:18,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 08:35:18,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 6840 proven. 852 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-17 08:35:19,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 6810 proven. 882 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-17 08:35:19,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652014279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:19,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:19,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-17 08:35:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487455974] [2024-11-17 08:35:19,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:19,509 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:35:19,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:35:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash -693416950, now seen corresponding path program 23 times [2024-11-17 08:35:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:35:19,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293274288] [2024-11-17 08:35:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:35:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:35:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:35:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6687 backedges. 98 proven. 5687 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-17 08:35:19,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:35:19,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293274288] [2024-11-17 08:35:19,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293274288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:35:19,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597831178] [2024-11-17 08:35:19,924 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:35:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:35:19,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:35:19,926 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:35:19,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2024-11-17 08:35:20,151 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2024-11-17 08:35:20,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:35:20,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 08:35:20,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:35:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6687 backedges. 3948 proven. 2032 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-17 08:35:20,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:35:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6687 backedges. 3948 proven. 2032 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-17 08:35:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597831178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:35:21,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:35:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 25] total 41 [2024-11-17 08:35:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161813426] [2024-11-17 08:35:21,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:35:21,221 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:35:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:35:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-17 08:35:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2024-11-17 08:35:21,221 INFO L87 Difference]: Start difference. First operand 1637 states and 1699 transitions. cyclomatic complexity: 69 Second operand has 41 states, 41 states have (on average 4.780487804878049) internal successors, (196), 41 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)