./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_mul_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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/array-industry-pattern/array_mul_init.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 09dc663f7f76eee13b6af61297831e3fbddcb16c16389bf8d94f2d27048733d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:23:29,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:23:29,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:23:29,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:23:29,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:23:29,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:23:29,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:23:29,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:23:29,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:23:29,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:23:29,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:23:29,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:23:29,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:23:29,720 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:23:29,721 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:23:29,721 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:23:29,721 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:23:29,722 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:23:29,722 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:23:29,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:23:29,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:23:29,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:23:29,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:23:29,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:23:29,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:23:29,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:23:29,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:23:29,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:23:29,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:23:29,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:23:29,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:23:29,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:23:29,729 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:23:29,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:23:29,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:23:29,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:23:29,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:23:29,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:23:29,733 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:23:29,733 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 -> 09dc663f7f76eee13b6af61297831e3fbddcb16c16389bf8d94f2d27048733d0 [2024-11-19 14:23:29,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:23:29,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:23:29,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:23:29,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:23:29,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:23:29,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2024-11-19 14:23:31,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:23:31,659 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:23:31,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2024-11-19 14:23:31,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6faa422e5/d353e386adf94f948120975970f1546c/FLAGdd481e690 [2024-11-19 14:23:32,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6faa422e5/d353e386adf94f948120975970f1546c [2024-11-19 14:23:32,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:23:32,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:23:32,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:32,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:23:32,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:23:32,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca5d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32, skipping insertion in model container [2024-11-19 14:23:32,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:23:32,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:32,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:23:32,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:32,322 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:23:32,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32 WrapperNode [2024-11-19 14:23:32,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:32,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:32,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:23:32,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:23:32,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,368 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-19 14:23:32,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:32,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:23:32,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:23:32,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:23:32,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,402 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 5, 4]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2024-11-19 14:23:32,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:23:32,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:23:32,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:23:32,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:23:32,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (1/1) ... [2024-11-19 14:23:32,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:32,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:32,464 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-19 14:23:32,482 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-19 14:23:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:23:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:23:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 14:23:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 14:23:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:23:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:23:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:23:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:23:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:23:32,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:23:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:23:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:23:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:23:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:23:32,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:23:32,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:23:32,825 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-19 14:23:32,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:23:32,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:23:32,837 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:23:32,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:32 BoogieIcfgContainer [2024-11-19 14:23:32,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:23:32,839 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:23:32,840 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:23:32,845 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:23:32,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:32,847 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:23:32" (1/3) ... [2024-11-19 14:23:32,848 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1879bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:32, skipping insertion in model container [2024-11-19 14:23:32,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:32,848 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:32" (2/3) ... [2024-11-19 14:23:32,850 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1879bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:32, skipping insertion in model container [2024-11-19 14:23:32,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:32,850 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:32" (3/3) ... [2024-11-19 14:23:32,851 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_mul_init.i [2024-11-19 14:23:32,914 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:23:32,914 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:23:32,914 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:23:32,915 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:23:32,915 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:23:32,915 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:23:32,915 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:23:32,915 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:23:32,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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-19 14:23:32,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:32,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:32,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:32,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:23:32,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:32,944 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:23:32,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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-19 14:23:32,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:32,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:32,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:32,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:23:32,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:32,956 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true 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(17, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 4#L21-3true [2024-11-19 14:23:32,957 INFO L747 eck$LassoCheckResult]: Loop: 4#L21-3true assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 18#L21-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4#L21-3true [2024-11-19 14:23:32,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:23:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780253256] [2024-11-19 14:23:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-19 14:23:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945105348] [2024-11-19 14:23:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:33,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-19 14:23:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370680592] [2024-11-19 14:23:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:33,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:33,698 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:33,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:33,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:33,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:33,699 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:33,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:33,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:33,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:33,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_mul_init.i_Iteration1_Lasso [2024-11-19 14:23:33,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:33,700 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:33,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:33,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:34,286 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:34,292 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,296 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-19 14:23:34,297 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-19 14:23:34,299 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-19 14:23:34,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,338 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-19 14:23:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,341 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-19 14:23:34,343 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-19 14:23:34,344 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-19 14:23:34,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:23:34,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,389 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-19 14:23:34,392 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-19 14:23:34,393 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-19 14:23:34,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,426 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-19 14:23:34,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,430 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-19 14:23:34,432 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-19 14:23:34,433 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-19 14:23:34,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,472 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-19 14:23:34,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,475 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-19 14:23:34,498 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-19 14:23:34,501 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-19 14:23:34,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,561 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-19 14:23:34,562 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-19 14:23:34,564 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-19 14:23:34,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,616 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-19 14:23:34,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,619 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-19 14:23:34,620 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-19 14:23:34,621 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-19 14:23:34,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:23:34,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,659 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-19 14:23:34,661 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-19 14:23:34,662 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-19 14:23:34,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:34,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:34,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:34,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:34,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,695 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-19 14:23:34,696 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-19 14:23:34,697 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-19 14:23:34,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:23:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,738 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-19 14:23:34,742 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-19 14:23:34,742 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-19 14:23:34,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:23:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,778 INFO L229 MonitoredProcess]: Starting monitored process 12 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-19 14:23:34,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:23:34,781 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-19 14:23:34,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:23:34,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,816 INFO L229 MonitoredProcess]: Starting monitored process 13 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-19 14:23:34,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:23:34,818 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-19 14:23:34,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:23:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,853 INFO L229 MonitoredProcess]: Starting monitored process 14 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-19 14:23:34,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:23:34,856 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-19 14:23:34,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:23:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,894 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-19 14:23:34,896 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-19 14:23:34,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-19 14:23:34,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:34,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:23:34,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:34,932 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-19 14:23:34,933 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-19 14:23:34,934 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-19 14:23:34,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:34,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:34,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:34,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:34,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:34,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:34,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:35,021 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-11-19 14:23:35,021 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-19 14:23:35,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:35,048 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-19 14:23:35,050 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-19 14:23:35,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:35,065 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:35,065 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:35,066 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:23:35,081 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-19 14:23:35,108 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-19 14:23:35,116 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:23:35,116 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:23:35,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:23:35,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:35,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:35,203 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-19 14:23:35,231 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-19 14:23:35,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-19 14:23:35,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 42 states and 61 transitions. Complement of second has 6 states. [2024-11-19 14:23:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-19 14:23:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-19 14:23:35,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-19 14:23:35,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:35,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:23:35,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:35,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:23:35,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:35,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. [2024-11-19 14:23:35,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-19 14:23:35,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 19 states and 27 transitions. [2024-11-19 14:23:35,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:23:35,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-19 14:23:35,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2024-11-19 14:23:35,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:35,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-19 14:23:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2024-11-19 14:23:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-19 14:23:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-19 14:23:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-11-19 14:23:35,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-19 14:23:35,312 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-19 14:23:35,313 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:23:35,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2024-11-19 14:23:35,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-19 14:23:35,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:35,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:35,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:23:35,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:35,314 INFO L745 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 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(17, 2); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 134#L21-3 assume !(main_~i~0#1 < 100000); 135#L21-4 main_~i~0#1 := 0; 148#L26-3 [2024-11-19 14:23:35,314 INFO L747 eck$LassoCheckResult]: Loop: 148#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 149#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 147#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 148#L26-3 [2024-11-19 14:23:35,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,315 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-19 14:23:35,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146993062] [2024-11-19 14:23:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,376 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-19 14:23:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:35,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146993062] [2024-11-19 14:23:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146993062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:23:35,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985185169] [2024-11-19 14:23:35,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:35,382 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2024-11-19 14:23:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017180767] [2024-11-19 14:23:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:23:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747022002] [2024-11-19 14:23:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:35,405 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:35,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 14:23:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:35,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:35,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:23:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:23:35,581 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-19 14:23:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:35,624 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-19 14:23:35,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2024-11-19 14:23:35,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:35,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 32 transitions. [2024-11-19 14:23:35,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:23:35,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-19 14:23:35,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2024-11-19 14:23:35,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:35,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-19 14:23:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2024-11-19 14:23:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2024-11-19 14:23:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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-19 14:23:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-19 14:23:35,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-19 14:23:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:23:35,633 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-19 14:23:35,633 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:23:35,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-19 14:23:35,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:35,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:35,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:35,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:35,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:35,636 INFO L745 eck$LassoCheckResult]: Stem: 202#$Ultimate##0 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(17, 2); 195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 187#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 188#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 189#L21-3 assume !(main_~i~0#1 < 100000); 190#L21-4 main_~i~0#1 := 0; 203#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 201#L28 [2024-11-19 14:23:35,636 INFO L747 eck$LassoCheckResult]: Loop: 201#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 198#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 199#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 201#L28 [2024-11-19 14:23:35,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2024-11-19 14:23:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999842095] [2024-11-19 14:23:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999842095] [2024-11-19 14:23:35,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999842095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072006649] [2024-11-19 14:23:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:35,727 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:35,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 14:23:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:35,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:23:35,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072006649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:35,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 14:23:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463608751] [2024-11-19 14:23:35,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:35,817 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:35,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 2 times [2024-11-19 14:23:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:35,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834834626] [2024-11-19 14:23:35,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:35,829 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:35,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:23:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798252510] [2024-11-19 14:23:35,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:35,833 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:35,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 14:23:35,876 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:35,876 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:35,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:35,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:23:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:23:36,004 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-19 14:23:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:36,115 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-19 14:23:36,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2024-11-19 14:23:36,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:36,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2024-11-19 14:23:36,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-19 14:23:36,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-19 14:23:36,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2024-11-19 14:23:36,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:36,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-11-19 14:23:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2024-11-19 14:23:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2024-11-19 14:23:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 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-19 14:23:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-19 14:23:36,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-19 14:23:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:23:36,127 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-19 14:23:36,127 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:23:36,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2024-11-19 14:23:36,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:36,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:36,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:36,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2024-11-19 14:23:36,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:36,130 INFO L745 eck$LassoCheckResult]: Stem: 316#$Ultimate##0 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(17, 2); 309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 301#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 302#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 303#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 304#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 328#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 326#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 324#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 322#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 321#L21-3 assume !(main_~i~0#1 < 100000); 317#L21-4 main_~i~0#1 := 0; 318#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 315#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 312#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 313#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 332#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 331#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 330#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 329#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 327#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 325#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 320#L28 [2024-11-19 14:23:36,130 INFO L747 eck$LassoCheckResult]: Loop: 320#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 323#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 319#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 320#L28 [2024-11-19 14:23:36,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1950889807, now seen corresponding path program 1 times [2024-11-19 14:23:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:36,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364171158] [2024-11-19 14:23:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:36,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:23:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364171158] [2024-11-19 14:23:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364171158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012612889] [2024-11-19 14:23:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:36,333 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:36,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-19 14:23:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:36,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:36,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:36,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012612889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:36,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 14:23:36,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128106451] [2024-11-19 14:23:36,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:36,518 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:36,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 3 times [2024-11-19 14:23:36,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:36,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535414735] [2024-11-19 14:23:36,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:36,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:36,526 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:36,527 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:23:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049744971] [2024-11-19 14:23:36,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:36,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:36,529 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:36,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-19 14:23:36,572 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:36,572 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:36,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:36,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 14:23:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 14:23:36,688 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 10 Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-19 14:23:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:36,887 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-11-19 14:23:36,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 139 transitions. [2024-11-19 14:23:36,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:36,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 139 transitions. [2024-11-19 14:23:36,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-11-19 14:23:36,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2024-11-19 14:23:36,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 139 transitions. [2024-11-19 14:23:36,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:36,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 139 transitions. [2024-11-19 14:23:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 139 transitions. [2024-11-19 14:23:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 62. [2024-11-19 14:23:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 61 states have internal predecessors, (75), 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-19 14:23:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-11-19 14:23:36,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-11-19 14:23:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:23:36,898 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-11-19 14:23:36,899 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:23:36,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 75 transitions. [2024-11-19 14:23:36,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:36,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:36,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:36,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 1, 1, 1, 1] [2024-11-19 14:23:36,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:36,903 INFO L745 eck$LassoCheckResult]: Stem: 607#$Ultimate##0 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(17, 2); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 594#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 595#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 596#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 597#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 608#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 643#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 641#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 639#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 637#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 635#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 633#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 631#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 629#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 627#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 625#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 623#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 621#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 619#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 617#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 615#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 614#L21-3 assume !(main_~i~0#1 < 100000); 609#L21-4 main_~i~0#1 := 0; 610#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 606#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 603#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 604#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 611#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 653#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 652#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 651#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 650#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 649#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 648#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 647#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 646#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 645#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 644#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 642#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 640#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 638#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 636#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 634#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 632#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 630#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 628#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 626#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 624#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 622#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 620#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 618#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 613#L28 [2024-11-19 14:23:36,903 INFO L747 eck$LassoCheckResult]: Loop: 613#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 616#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 612#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 613#L28 [2024-11-19 14:23:36,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash 403223997, now seen corresponding path program 2 times [2024-11-19 14:23:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202924231] [2024-11-19 14:23:36,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:36,934 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:36,934 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-19 14:23:37,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:37,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202924231] [2024-11-19 14:23:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202924231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197114287] [2024-11-19 14:23:37,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:37,211 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-19 14:23:37,213 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-19 14:23:37,327 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:37,328 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:37,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:23:37,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-19 14:23:37,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-19 14:23:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197114287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:37,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:37,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-19 14:23:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35659707] [2024-11-19 14:23:37,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:37,646 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:37,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 4 times [2024-11-19 14:23:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662678573] [2024-11-19 14:23:37,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:37,655 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:37,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:23:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369492773] [2024-11-19 14:23:37,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:37,658 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-19 14:23:37,660 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-19 14:23:37,705 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:37,705 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:37,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:37,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 14:23:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-19 14:23:37,810 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. cyclomatic complexity: 16 Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 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-19 14:23:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:38,175 INFO L93 Difference]: Finished difference Result 249 states and 295 transitions. [2024-11-19 14:23:38,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 295 transitions. [2024-11-19 14:23:38,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:38,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 295 transitions. [2024-11-19 14:23:38,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2024-11-19 14:23:38,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2024-11-19 14:23:38,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 295 transitions. [2024-11-19 14:23:38,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:38,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 295 transitions. [2024-11-19 14:23:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 295 transitions. [2024-11-19 14:23:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 122. [2024-11-19 14:23:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 121 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-19 14:23:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-11-19 14:23:38,190 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-11-19 14:23:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 14:23:38,191 INFO L425 stractBuchiCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-11-19 14:23:38,191 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:23:38,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 147 transitions. [2024-11-19 14:23:38,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:38,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:38,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:38,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 21, 21, 1, 1, 1, 1] [2024-11-19 14:23:38,196 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:38,196 INFO L745 eck$LassoCheckResult]: Stem: 1253#$Ultimate##0 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(17, 2); 1245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1237#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1238#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1239#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1240#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1338#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1336#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1334#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1332#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1330#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1328#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1326#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1324#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1322#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1320#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1318#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1316#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1314#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1312#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1310#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1308#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1306#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1304#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1302#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1300#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1298#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1296#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1294#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1292#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1290#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1288#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1286#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1284#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1282#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1280#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1278#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1276#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1274#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1272#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1270#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1268#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1266#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1264#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1262#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1260#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1259#L21-3 assume !(main_~i~0#1 < 100000); 1254#L21-4 main_~i~0#1 := 0; 1255#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1256#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1248#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1249#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1251#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1252#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1358#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1357#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1356#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1355#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1354#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1353#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1352#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1351#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1350#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1349#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1348#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1347#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1346#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1345#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1344#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1343#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1342#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1341#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1340#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1339#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1337#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1335#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1333#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1331#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1329#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1327#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1325#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1323#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1321#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1319#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1317#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1315#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1313#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1311#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1309#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1307#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1305#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1303#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1301#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1299#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1297#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1295#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1293#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1291#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1289#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1287#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1285#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1283#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1281#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1279#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1277#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1275#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1273#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1271#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1269#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1267#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1265#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1263#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1258#L28 [2024-11-19 14:23:38,200 INFO L747 eck$LassoCheckResult]: Loop: 1258#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1261#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1257#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1258#L28 [2024-11-19 14:23:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash 615339989, now seen corresponding path program 3 times [2024-11-19 14:23:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176585392] [2024-11-19 14:23:38,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:38,357 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-19 14:23:38,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-19 14:23:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176585392] [2024-11-19 14:23:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176585392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226396010] [2024-11-19 14:23:39,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:39,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:39,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:39,187 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-19 14:23:39,188 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-19 14:23:44,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-19 14:23:44,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:44,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 14:23:44,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-19 14:23:44,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-19 14:23:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226396010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:45,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:45,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-19 14:23:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277300517] [2024-11-19 14:23:45,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:45,599 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:45,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 5 times [2024-11-19 14:23:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000415721] [2024-11-19 14:23:45,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:45,607 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:45,611 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:23:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32658835] [2024-11-19 14:23:45,612 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:45,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:45,615 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-19 14:23:45,617 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-19 14:23:45,670 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:45,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:45,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:45,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:45,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-19 14:23:45,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 14:23:45,769 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. cyclomatic complexity: 28 Second operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 49 states have internal predecessors, (100), 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-19 14:23:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:46,599 INFO L93 Difference]: Finished difference Result 513 states and 607 transitions. [2024-11-19 14:23:46,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 607 transitions. [2024-11-19 14:23:46,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:46,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 513 states and 607 transitions. [2024-11-19 14:23:46,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 421 [2024-11-19 14:23:46,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2024-11-19 14:23:46,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 607 transitions. [2024-11-19 14:23:46,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:46,609 INFO L218 hiAutomatonCegarLoop]: Abstraction has 513 states and 607 transitions. [2024-11-19 14:23:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 607 transitions. [2024-11-19 14:23:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 242. [2024-11-19 14:23:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.2024793388429753) internal successors, (291), 241 states have internal predecessors, (291), 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-19 14:23:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2024-11-19 14:23:46,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 291 transitions. [2024-11-19 14:23:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-19 14:23:46,625 INFO L425 stractBuchiCegarLoop]: Abstraction has 242 states and 291 transitions. [2024-11-19 14:23:46,626 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:23:46,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 291 transitions. [2024-11-19 14:23:46,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:46,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:46,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:46,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 45, 45, 1, 1, 1, 1] [2024-11-19 14:23:46,630 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:46,631 INFO L745 eck$LassoCheckResult]: Stem: 2606#$Ultimate##0 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(17, 2); 2598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2590#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2591#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2592#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2593#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2787#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2785#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2783#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2781#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2779#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2777#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2775#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2773#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2771#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2769#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2767#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2765#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2763#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2761#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2759#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2757#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2755#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2753#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2751#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2749#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2747#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2745#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2743#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2741#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2739#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2737#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2735#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2733#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2731#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2729#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2727#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2725#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2723#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2721#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2719#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2717#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2715#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2713#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2711#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2709#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2707#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2705#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2703#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2701#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2699#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2697#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2695#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2693#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2691#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2689#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2687#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2685#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2683#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2681#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2679#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2677#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2675#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2673#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2671#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2669#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2667#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2665#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2663#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2661#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2659#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2657#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2655#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2653#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2651#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2649#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2647#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2645#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2643#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2641#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2639#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2637#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2635#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2633#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2631#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2629#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2627#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2625#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2623#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2621#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2619#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2617#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2615#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2613#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2612#L21-3 assume !(main_~i~0#1 < 100000); 2607#L21-4 main_~i~0#1 := 0; 2608#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2609#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2601#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2602#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2604#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2605#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2831#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2830#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2829#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2828#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2827#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2826#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2825#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2824#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2823#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2822#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2821#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2820#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2819#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2818#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2817#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2816#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2815#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2814#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2813#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2812#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2811#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2810#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2809#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2808#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2807#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2806#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2805#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2804#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2803#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2802#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2801#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2800#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2799#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2798#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2797#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2796#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2795#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2794#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2793#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2792#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2791#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2790#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2789#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2788#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2786#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2784#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2782#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2780#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2778#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2776#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2774#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2772#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2770#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2768#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2766#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2764#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2762#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2760#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2758#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2756#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2754#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2752#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2750#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2748#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2746#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2744#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2742#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2740#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2738#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2736#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2734#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2732#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2730#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2728#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2726#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2724#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2722#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2720#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2718#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2716#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2714#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2712#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2710#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2708#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2706#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2704#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2702#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2700#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2698#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2696#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2694#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2692#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2690#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2688#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2686#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2684#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2682#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2680#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2678#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2676#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2674#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2672#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2670#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2668#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2666#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2664#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2662#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2660#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2658#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2656#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2654#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2652#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2650#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2648#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2646#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2644#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2642#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2640#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2638#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2636#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2634#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2632#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2630#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2628#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2626#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2624#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2622#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2620#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2618#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2616#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2611#L28 [2024-11-19 14:23:46,631 INFO L747 eck$LassoCheckResult]: Loop: 2611#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2614#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2610#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2611#L28 [2024-11-19 14:23:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 982432773, now seen corresponding path program 4 times [2024-11-19 14:23:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225392337] [2024-11-19 14:23:46,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:46,734 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:46,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2024-11-19 14:23:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225392337] [2024-11-19 14:23:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225392337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336904533] [2024-11-19 14:23:49,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:49,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:49,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:49,209 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:49,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-19 14:23:49,442 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:49,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:49,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-19 14:23:49,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2024-11-19 14:23:49,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2024-11-19 14:23:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336904533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:52,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-11-19 14:23:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797351456] [2024-11-19 14:23:52,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:52,091 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 6 times [2024-11-19 14:23:52,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:52,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139195473] [2024-11-19 14:23:52,091 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:23:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:52,099 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:23:52,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:23:52,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361571801] [2024-11-19 14:23:52,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:23:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:52,102 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-19 14:23:52,172 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:23:52,172 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:52,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:52,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-19 14:23:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-19 14:23:52,299 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. cyclomatic complexity: 52 Second operand has 96 states, 96 states have (on average 2.0104166666666665) internal successors, (193), 96 states have internal predecessors, (193), 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-19 14:23:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:56,054 INFO L93 Difference]: Finished difference Result 1041 states and 1231 transitions. [2024-11-19 14:23:56,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1231 transitions. [2024-11-19 14:23:56,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:56,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1231 transitions. [2024-11-19 14:23:56,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2024-11-19 14:23:56,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2024-11-19 14:23:56,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1231 transitions. [2024-11-19 14:23:56,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:56,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1041 states and 1231 transitions. [2024-11-19 14:23:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1231 transitions. [2024-11-19 14:23:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 482. [2024-11-19 14:23:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.2012448132780082) internal successors, (579), 481 states have internal predecessors, (579), 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-19 14:23:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 579 transitions. [2024-11-19 14:23:56,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 579 transitions. [2024-11-19 14:23:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-19 14:23:56,099 INFO L425 stractBuchiCegarLoop]: Abstraction has 482 states and 579 transitions. [2024-11-19 14:23:56,099 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:23:56,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 579 transitions. [2024-11-19 14:23:56,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:23:56,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:56,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:56,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 93, 93, 1, 1, 1, 1] [2024-11-19 14:23:56,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:56,113 INFO L745 eck$LassoCheckResult]: Stem: 5374#$Ultimate##0 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(17, 2); 5366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 5358#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5359#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5360#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5361#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5747#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5745#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5743#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5741#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5739#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5737#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5735#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5733#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5731#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5729#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5727#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5725#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5723#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5721#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5719#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5717#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5715#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5713#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5711#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5709#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5707#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5705#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5703#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5701#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5699#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5697#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5695#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5693#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5691#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5689#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5687#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5685#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5683#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5681#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5679#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5677#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5675#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5673#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5671#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5669#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5667#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5665#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5663#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5661#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5659#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5657#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5655#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5653#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5651#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5649#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5647#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5645#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5643#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5641#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5639#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5637#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5635#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5633#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5631#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5629#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5627#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5625#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5623#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5621#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5619#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5617#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5615#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5613#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5611#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5609#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5607#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5605#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5603#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5601#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5599#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5597#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5595#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5593#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5591#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5589#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5587#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5585#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5583#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5581#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5579#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5577#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5575#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5573#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5571#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5569#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5567#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5565#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5563#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5561#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5559#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5557#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5555#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5553#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5551#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5549#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5547#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5545#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5543#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5541#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5539#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5537#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5535#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5533#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5531#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5529#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5527#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5525#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5523#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5521#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5519#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5517#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5515#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5513#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5511#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5509#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5507#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5505#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5503#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5501#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5499#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5497#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5495#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5493#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5491#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5489#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5487#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5485#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5483#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5481#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5479#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5477#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5475#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5473#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5471#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5469#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5467#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5465#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5463#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5461#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5459#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5457#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5455#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5453#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5451#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5449#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5447#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5445#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5443#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5441#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5439#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5437#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5435#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5433#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5431#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5429#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5427#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5425#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5423#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5421#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5419#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5417#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5415#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5413#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5411#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5409#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5407#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5405#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5403#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5401#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5399#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5397#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5395#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5393#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5391#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5389#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5387#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5385#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5383#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5381#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5380#L21-3 assume !(main_~i~0#1 < 100000); 5375#L21-4 main_~i~0#1 := 0; 5376#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5377#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5369#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5370#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5372#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5373#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5839#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5838#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5837#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5836#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5835#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5834#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5833#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5832#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5831#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5830#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5829#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5828#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5827#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5826#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5825#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5824#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5823#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5822#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5821#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5820#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5819#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5818#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5817#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5816#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5815#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5814#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5813#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5812#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5811#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5810#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5809#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5808#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5807#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5806#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5805#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5804#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5803#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5802#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5801#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5800#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5799#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5798#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5797#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5796#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5795#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5794#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5793#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5792#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5791#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5790#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5789#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5788#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5787#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5786#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5785#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5784#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5783#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5782#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5781#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5780#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5779#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5778#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5777#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5776#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5775#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5774#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5773#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5772#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5771#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5770#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5769#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5768#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5767#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5766#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5765#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5764#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5763#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5762#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5761#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5760#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5759#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5758#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5757#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5756#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5755#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5754#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5753#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5752#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5751#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5750#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5749#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5748#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5746#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5744#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5742#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5740#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5738#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5736#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5734#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5732#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5730#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5728#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5726#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5724#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5722#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5720#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5718#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5716#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5714#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5712#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5710#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5708#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5706#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5704#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5702#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5700#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5698#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5696#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5694#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5692#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5690#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5688#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5686#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5684#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5682#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5680#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5678#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5676#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5674#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5672#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5670#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5668#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5666#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5664#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5662#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5660#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5658#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5656#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5654#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5652#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5650#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5648#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5646#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5644#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5642#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5640#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5638#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5636#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5634#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5632#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5630#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5628#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5626#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5624#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5622#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5620#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5618#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5616#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5614#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5612#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5610#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5608#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5606#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5604#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5602#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5600#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5598#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5596#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5594#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5592#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5590#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5588#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5586#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5584#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5582#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5580#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5578#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5576#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5574#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5572#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5570#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5568#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5566#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5564#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5562#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5560#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5558#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5556#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5554#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5552#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5550#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5548#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5546#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5544#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5542#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5540#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5538#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5536#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5534#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5532#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5530#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5528#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5526#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5524#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5522#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5520#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5518#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5516#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5514#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5512#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5510#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5508#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5506#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5504#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5502#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5500#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5498#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5496#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5494#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5492#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5490#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5488#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5486#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5484#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5482#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5480#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5478#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5476#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5474#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5472#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5470#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5468#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5466#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5464#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5462#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5460#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5458#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5456#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5454#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5452#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5450#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5448#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5446#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5444#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5442#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5440#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5438#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5436#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5434#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5432#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5430#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5428#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5426#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5424#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5422#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5420#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5418#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5416#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5414#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5412#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5410#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5408#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5406#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5404#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5402#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5400#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5398#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5396#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5394#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5392#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5390#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5388#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5386#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5384#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5379#L28 [2024-11-19 14:23:56,114 INFO L747 eck$LassoCheckResult]: Loop: 5379#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5382#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5378#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5379#L28 [2024-11-19 14:23:56,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1696203877, now seen corresponding path program 5 times [2024-11-19 14:23:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169393045] [2024-11-19 14:23:56,115 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:57,808 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2024-11-19 14:23:57,808 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:24:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21763 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 12927 trivial. 0 not checked. [2024-11-19 14:24:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:24:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169393045] [2024-11-19 14:24:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169393045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:24:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085690573] [2024-11-19 14:24:06,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:24:06,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:24:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:06,015 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:24:06,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process