./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_mul_init.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-10 07:10:35,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:10:35,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:10:35,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:10:35,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:10:35,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:10:35,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:10:35,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:10:35,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:10:35,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:10:35,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:10:35,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:10:35,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:10:35,760 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:10:35,760 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:10:35,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:10:35,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:10:35,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:10:35,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:10:35,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:10:35,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:10:35,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:10:35,763 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:10:35,763 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 [2025-01-10 07:10:36,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:10:36,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:10:36,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:10:36,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:10:36,030 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:10:36,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2025-01-10 07:10:37,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eeb0e6aa/48922e65b681402f87ebbbac9393b1e6/FLAGe543b7285 [2025-01-10 07:10:37,677 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:10:37,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2025-01-10 07:10:37,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eeb0e6aa/48922e65b681402f87ebbbac9393b1e6/FLAGe543b7285 [2025-01-10 07:10:37,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eeb0e6aa/48922e65b681402f87ebbbac9393b1e6 [2025-01-10 07:10:37,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:10:37,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:10:37,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:37,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:10:37,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:10:37,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:37" (1/1) ... [2025-01-10 07:10:37,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30490454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:37, skipping insertion in model container [2025-01-10 07:10:37,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:37" (1/1) ... [2025-01-10 07:10:37,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:10:38,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:38,250 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:10:38,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:38,314 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:10:38,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38 WrapperNode [2025-01-10 07:10:38,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:38,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:38,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:10:38,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:10:38,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,377 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-01-10 07:10:38,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:38,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:10:38,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:10:38,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:10:38,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,424 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 4, 5]. 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]. [2025-01-10 07:10:38,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:10:38,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:10:38,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:10:38,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:10:38,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (1/1) ... [2025-01-10 07:10:38,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:38,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:38,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:38,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:10:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:10:38,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:10:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:10:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:10:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:10:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:10:38,580 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:10:38,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:10:38,677 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-10 07:10:38,678 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:10:38,683 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:10:38,683 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:10:38,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:38 BoogieIcfgContainer [2025-01-10 07:10:38,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:10:38,684 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:10:38,684 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:10:38,688 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:10:38,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:38,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:10:37" (1/3) ... [2025-01-10 07:10:38,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c957b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:38, skipping insertion in model container [2025-01-10 07:10:38,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:38,690 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:38" (2/3) ... [2025-01-10 07:10:38,690 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c957b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:38, skipping insertion in model container [2025-01-10 07:10:38,690 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:38,690 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:38" (3/3) ... [2025-01-10 07:10:38,691 INFO L363 chiAutomizerObserver]: Analyzing ICFG array_mul_init.i [2025-01-10 07:10:38,723 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:10:38,724 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:10:38,724 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:10:38,724 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:10:38,724 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:10:38,724 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:10:38,724 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:10:38,724 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:10:38,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:38,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-01-10 07:10:38,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:38,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:38,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:38,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:38,740 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:10:38,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:38,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-01-10 07:10:38,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:38,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:38,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:38,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:38,746 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" [2025-01-10 07:10:38,746 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" [2025-01-10 07:10:38,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:10:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791814338] [2025-01-10 07:10:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:38,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:38,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:38,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:38,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:38,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 07:10:38,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346288650] [2025-01-10 07:10:38,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:38,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:38,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:38,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:38,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:38,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:38,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:10:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:38,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880731225] [2025-01-10 07:10:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:38,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:38,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:39,316 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:39,319 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:39,319 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:39,319 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:39,319 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:39,319 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,319 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:39,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:39,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_mul_init.i_Iteration1_Lasso [2025-01-10 07:10:39,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:39,320 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:39,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,843 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:39,846 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:10:39,867 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 [2025-01-10 07:10:39,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:10:39,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:10:39,904 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 [2025-01-10 07:10:39,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:10:39,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:10:39,943 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 [2025-01-10 07:10:39,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:10:39,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:10:40,000 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 [2025-01-10 07:10:40,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:40,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:40,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:40,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:10:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:10:40,032 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 [2025-01-10 07:10:40,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:40,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:40,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:40,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:40,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:10:40,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:10:40,061 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 [2025-01-10 07:10:40,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:40,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:40,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:40,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:40,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,091 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:10:40,094 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 [2025-01-10 07:10:40,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:40,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:40,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:40,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:10:40,120 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 [2025-01-10 07:10:40,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:40,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:40,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:40,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:40,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:10:40,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:10:40,145 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 [2025-01-10 07:10:40,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:40,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:40,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:40,190 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-01-10 07:10:40,192 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-01-10 07:10:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:10:40,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:40,209 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:40,209 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:40,210 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 [] [2025-01-10 07:10:40,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:40,246 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-01-10 07:10:40,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:10:40,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:10:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:40,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:40,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:40,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,331 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:10:40,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2025-01-10 07:10:40,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 19 states and 27 transitions. Complement of second has 3 states. [2025-01-10 07:10:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2025-01-10 07:10:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:10:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 07:10:40,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:10:40,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:10:40,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:40,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. [2025-01-10 07:10:40,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:10:40,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 24 transitions. [2025-01-10 07:10:40,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-01-10 07:10:40,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-01-10 07:10:40,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2025-01-10 07:10:40,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:40,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-01-10 07:10:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2025-01-10 07:10:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-01-10 07:10:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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) [2025-01-10 07:10:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-01-10 07:10:40,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-01-10 07:10:40,392 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-01-10 07:10:40,392 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:10:40,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2025-01-10 07:10:40,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:10:40,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:40,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:40,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:10:40,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:40,392 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:40,392 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 07:10:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267086235] [2025-01-10 07:10:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:40,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267086235] [2025-01-10 07:10:40,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267086235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:10:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:10:40,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:10:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885790483] [2025-01-10 07:10:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:10:40,482 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 41869, now seen corresponding path program 1 times [2025-01-10 07:10:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916638584] [2025-01-10 07:10:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:40,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:40,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:40,507 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:40,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:40,508 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:40,508 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:40,508 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:10:40,508 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,508 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:40,508 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:40,508 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_mul_init.i_Iteration2_Loop [2025-01-10 07:10:40,508 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:40,508 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:40,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:40,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:40,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:40,544 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:40,545 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:10:40,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,551 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:10:40,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:10:40,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:10:40,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:10:40,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,577 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:10:40,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:10:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:10:40,603 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:10:40,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:40,607 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:40,607 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:40,607 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:40,607 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:40,607 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:40,607 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,607 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:40,607 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:40,607 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_mul_init.i_Iteration2_Loop [2025-01-10 07:10:40,607 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:40,607 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:40,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:40,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:40,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:40,655 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:40,655 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,658 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:10:40,659 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 [2025-01-10 07:10:40,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:40,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:40,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:40,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:40,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:40,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:40,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:40,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:40,674 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:10:40,674 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:10:40,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:40,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,677 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:10:40,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:40,682 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:10:40,682 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:40,682 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199999 Supporting invariants [] [2025-01-10 07:10:40,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 07:10:40,688 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:10:40,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,732 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 [2025-01-10 07:10:40,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-01-10 07:10:40,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19 states and 29 transitions. Complement of second has 5 states. [2025-01-10 07:10:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-01-10 07:10:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:10:40,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2025-01-10 07:10:40,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:40,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2025-01-10 07:10:40,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:40,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2025-01-10 07:10:40,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:40,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. [2025-01-10 07:10:40,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:10:40,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 25 transitions. [2025-01-10 07:10:40,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 07:10:40,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 07:10:40,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2025-01-10 07:10:40,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:40,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2025-01-10 07:10:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2025-01-10 07:10:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-01-10 07:10:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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) [2025-01-10 07:10:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-01-10 07:10:40,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-01-10 07:10:40,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:40,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:10:40,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:10:40,765 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-01-10 07:10:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:40,791 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2025-01-10 07:10:40,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2025-01-10 07:10:40,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:40,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 26 transitions. [2025-01-10 07:10:40,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-01-10 07:10:40,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-01-10 07:10:40,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2025-01-10 07:10:40,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:40,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-01-10 07:10:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2025-01-10 07:10:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2025-01-10 07:10:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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) [2025-01-10 07:10:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-01-10 07:10:40,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:10:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:10:40,797 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:10:40,797 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:10:40,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-01-10 07:10:40,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:40,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:40,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:40,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:40,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:10:40,798 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:40,798 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem5#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem5#1 == main_#t~mem6#1;" "assume main_#t~short10#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~mem9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-01-10 07:10:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 147088490, now seen corresponding path program 1 times [2025-01-10 07:10:40,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512410838] [2025-01-10 07:10:40,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:10:40,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:10:40,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:10:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512410838] [2025-01-10 07:10:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512410838] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044936715] [2025-01-10 07:10:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,910 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 07:10:40,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:10:40,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:10:40,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:10:40,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:10:41,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044936715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:41,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:41,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 07:10:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536831923] [2025-01-10 07:10:41,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:41,003 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:41,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 52583550, now seen corresponding path program 1 times [2025-01-10 07:10:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513272597] [2025-01-10 07:10:41,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:41,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:41,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:41,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:41,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:41,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:41,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:41,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:41,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:41,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:41,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:10:41,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:10:41,154 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) [2025-01-10 07:10:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:41,231 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-01-10 07:10:41,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2025-01-10 07:10:41,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:41,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2025-01-10 07:10:41,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-01-10 07:10:41,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-01-10 07:10:41,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2025-01-10 07:10:41,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:41,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2025-01-10 07:10:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2025-01-10 07:10:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2025-01-10 07:10:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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) [2025-01-10 07:10:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-01-10 07:10:41,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-01-10 07:10:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:10:41,241 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-01-10 07:10:41,241 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:10:41,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2025-01-10 07:10:41,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:41,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:41,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:41,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 07:10:41,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:10:41,245 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:41,245 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem5#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem5#1 == main_#t~mem6#1;" "assume main_#t~short10#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~mem9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-01-10 07:10:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1208515696, now seen corresponding path program 2 times [2025-01-10 07:10:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113318772] [2025-01-10 07:10:41,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:41,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 07:10:41,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:10:41,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:41,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:10:41,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:10:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 07:10:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113318772] [2025-01-10 07:10:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113318772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192741650] [2025-01-10 07:10:41,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:41,479 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:41,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 07:10:41,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 07:10:41,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:10:41,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:41,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:41,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 07:10:41,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 07:10:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192741650] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:41,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:41,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 07:10:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579304753] [2025-01-10 07:10:41,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:41,628 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash 52583550, now seen corresponding path program 2 times [2025-01-10 07:10:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476091697] [2025-01-10 07:10:41,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:41,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:41,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:41,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:41,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:41,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:41,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:41,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:41,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:41,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:41,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:41,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:10:41,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:10:41,750 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 10 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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) [2025-01-10 07:10:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:41,911 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2025-01-10 07:10:41,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 117 transitions. [2025-01-10 07:10:41,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:41,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 117 transitions. [2025-01-10 07:10:41,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-01-10 07:10:41,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-01-10 07:10:41,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 117 transitions. [2025-01-10 07:10:41,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:41,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 117 transitions. [2025-01-10 07:10:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 117 transitions. [2025-01-10 07:10:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 49. [2025-01-10 07:10:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 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) [2025-01-10 07:10:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-01-10 07:10:41,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-01-10 07:10:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:10:41,925 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-01-10 07:10:41,925 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:10:41,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 62 transitions. [2025-01-10 07:10:41,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:41,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:41,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:41,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 1, 1, 1, 1] [2025-01-10 07:10:41,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:10:41,927 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:41,930 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem5#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem5#1 == main_#t~mem6#1;" "assume main_#t~short10#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~mem9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-01-10 07:10:41,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1860812592, now seen corresponding path program 3 times [2025-01-10 07:10:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405973091] [2025-01-10 07:10:41,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:41,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-01-10 07:10:42,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 29 of 44 statements. [2025-01-10 07:10:42,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:42,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 07:10:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405973091] [2025-01-10 07:10:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405973091] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632479988] [2025-01-10 07:10:42,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:42,268 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:42,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 07:10:42,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-01-10 07:10:43,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 29 of 44 statements. [2025-01-10 07:10:43,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:43,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:43,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 07:10:43,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 07:10:43,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-10 07:10:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632479988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:44,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:44,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-10 07:10:44,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928661027] [2025-01-10 07:10:44,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:44,020 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 52583550, now seen corresponding path program 3 times [2025-01-10 07:10:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220321485] [2025-01-10 07:10:44,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:44,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:44,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:44,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:10:44,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:44,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:44,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:44,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:44,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:44,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:44,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 07:10:44,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 07:10:44,129 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. cyclomatic complexity: 16 Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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) [2025-01-10 07:10:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:44,375 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2025-01-10 07:10:44,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 249 transitions. [2025-01-10 07:10:44,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:44,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 203 states and 249 transitions. [2025-01-10 07:10:44,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-01-10 07:10:44,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-01-10 07:10:44,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 249 transitions. [2025-01-10 07:10:44,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:44,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 249 transitions. [2025-01-10 07:10:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 249 transitions. [2025-01-10 07:10:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 97. [2025-01-10 07:10:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 96 states have internal predecessors, (122), 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) [2025-01-10 07:10:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2025-01-10 07:10:44,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 122 transitions. [2025-01-10 07:10:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:10:44,387 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 122 transitions. [2025-01-10 07:10:44,387 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:10:44,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 122 transitions. [2025-01-10 07:10:44,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:44,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:44,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:44,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 22, 1, 1, 1, 1] [2025-01-10 07:10:44,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:10:44,390 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:44,391 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem5#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem5#1 == main_#t~mem6#1;" "assume main_#t~short10#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~mem9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-01-10 07:10:44,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash 712854352, now seen corresponding path program 4 times [2025-01-10 07:10:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751790225] [2025-01-10 07:10:44,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:44,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-01-10 07:10:44,480 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 07:10:44,480 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-10 07:10:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751790225] [2025-01-10 07:10:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751790225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569761416] [2025-01-10 07:10:45,307 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:45,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:45,313 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:45,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 07:10:45,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-01-10 07:10:48,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 07:10:48,358 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:48,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:48,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:10:48,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-10 07:10:48,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-10 07:10:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569761416] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:49,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:49,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 07:10:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582286815] [2025-01-10 07:10:49,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:49,224 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash 52583550, now seen corresponding path program 4 times [2025-01-10 07:10:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363231488] [2025-01-10 07:10:49,224 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:49,229 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-01-10 07:10:49,232 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:49,232 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:49,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:49,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:49,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:49,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:49,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:49,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:49,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 07:10:49,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 07:10:49,344 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. cyclomatic complexity: 28 Second operand has 48 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 48 states have internal predecessors, (139), 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) [2025-01-10 07:10:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:50,072 INFO L93 Difference]: Finished difference Result 419 states and 513 transitions. [2025-01-10 07:10:50,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 513 transitions. [2025-01-10 07:10:50,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:50,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 513 transitions. [2025-01-10 07:10:50,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2025-01-10 07:10:50,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2025-01-10 07:10:50,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 513 transitions. [2025-01-10 07:10:50,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:50,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 419 states and 513 transitions. [2025-01-10 07:10:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 513 transitions. [2025-01-10 07:10:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 193. [2025-01-10 07:10:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 193 states have (on average 1.2538860103626943) internal successors, (242), 192 states have internal predecessors, (242), 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) [2025-01-10 07:10:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 242 transitions. [2025-01-10 07:10:50,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-01-10 07:10:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:10:50,096 INFO L432 stractBuchiCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-01-10 07:10:50,096 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:10:50,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 242 transitions. [2025-01-10 07:10:50,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:50,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:50,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:50,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 46, 1, 1, 1, 1] [2025-01-10 07:10:50,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:10:50,103 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#2(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet2#1;" "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#2(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:50,104 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem5#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem5#1 == main_#t~mem6#1;" "assume main_#t~short10#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~mem9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-01-10 07:10:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 723624016, now seen corresponding path program 5 times [2025-01-10 07:10:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076585305] [2025-01-10 07:10:50,105 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:50,182 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 47 equivalence classes. [2025-01-10 07:10:51,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 07:10:51,522 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 07:10:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:56,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076585305] [2025-01-10 07:10:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076585305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208254869] [2025-01-10 07:10:56,896 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:56,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:56,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:56,902 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:56,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 07:10:57,054 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 47 equivalence classes.