./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:59:48,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:59:48,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 19:59:48,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:59:48,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:59:48,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:59:48,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:59:48,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:59:48,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:59:48,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:59:48,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:59:48,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:59:48,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:59:48,684 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:59:48,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:59:48,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:59:48,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:59:48,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:59:48,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:59:48,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:59:48,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:59:48,686 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:59:48,686 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/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 -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2025-03-17 19:59:48,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:59:48,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:59:48,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:59:48,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:59:48,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:59:48,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2025-03-17 19:59:50,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67386777/0867a7c5341740ce849d08ec78b66152/FLAG6afa089b6 [2025-03-17 19:59:50,235 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:59:50,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2025-03-17 19:59:50,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67386777/0867a7c5341740ce849d08ec78b66152/FLAG6afa089b6 [2025-03-17 19:59:50,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67386777/0867a7c5341740ce849d08ec78b66152 [2025-03-17 19:59:50,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:59:50,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:59:50,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:59:50,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:59:50,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:59:50,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65abf7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50, skipping insertion in model container [2025-03-17 19:59:50,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:59:50,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:59:50,698 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:59:50,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:59:50,721 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:59:50,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50 WrapperNode [2025-03-17 19:59:50,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:59:50,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:59:50,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:59:50,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:59:50,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,745 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-03-17 19:59:50,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:59:50,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:59:50,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:59:50,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:59:50,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,768 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-17 19:59:50,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:59:50,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:59:50,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:59:50,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:59:50,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (1/1) ... [2025-03-17 19:59:50,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:50,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:50,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:50,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:59:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:59:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:59:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:59:50,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:59:50,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:59:50,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:59:50,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:59:50,951 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 19:59:50,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:59:50,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:59:50,958 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:59:50,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:59:50 BoogieIcfgContainer [2025-03-17 19:59:50,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:59:50,959 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:59:50,959 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:59:50,963 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:59:50,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:50,963 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:59:50" (1/3) ... [2025-03-17 19:59:50,964 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ca2e7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:59:50, skipping insertion in model container [2025-03-17 19:59:50,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:50,964 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:50" (2/3) ... [2025-03-17 19:59:50,964 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ca2e7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:59:50, skipping insertion in model container [2025-03-17 19:59:50,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:50,964 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:59:50" (3/3) ... [2025-03-17 19:59:50,965 INFO L363 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2025-03-17 19:59:50,994 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:59:50,994 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:59:50,994 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:59:50,994 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:59:50,994 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:59:50,995 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:59:50,995 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:59:50,995 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:59:50,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:51,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:59:51,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:51,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:51,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:59:51,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:51,012 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:59:51,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:51,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:59:51,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:51,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:51,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:59:51,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:51,019 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" [2025-03-17 19:59:51,020 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int#2(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-03-17 19:59:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455893101] [2025-03-17 19:59:51,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:51,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:51,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:51,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:51,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 1 times [2025-03-17 19:59:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263988902] [2025-03-17 19:59:51,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:51,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:51,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:51,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:51,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1415007, now seen corresponding path program 1 times [2025-03-17 19:59:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13058077] [2025-03-17 19:59:51,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:51,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:51,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:51,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:51,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:51,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:51,496 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:51,496 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:51,496 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:51,497 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:51,497 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:51,497 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,497 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:51,497 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:51,497 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2025-03-17 19:59:51,497 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:51,497 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:51,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,890 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:51,893 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:51,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:59:51,899 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-03-17 19:59:51,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:59:51,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:51,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:59:51,935 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-03-17 19:59:51,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:51,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:59:51,961 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-03-17 19:59:51,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:51,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:51,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:51,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:51,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:59:51,984 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-03-17 19:59:51,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:52,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:59:52,009 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-03-17 19:59:52,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:52,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:52,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:52,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 19:59:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,029 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:59:52,031 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-03-17 19:59:52,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 19:59:52,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:59:52,057 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-03-17 19:59:52,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:59:52,086 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-03-17 19:59:52,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:59:52,114 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-03-17 19:59:52,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 19:59:52,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:59:52,140 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-03-17 19:59:52,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:59:52,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:59:52,167 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-03-17 19:59:52,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:52,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:52,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:59:52,193 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-03-17 19:59:52,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:52,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:52,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:52,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:52,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:52,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:52,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:52,246 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 19:59:52,249 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 19:59:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,254 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:59:52,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:52,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:59:52,269 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:52,269 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 Supporting invariants [] [2025-03-17 19:59:52,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:59:52,306 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 19:59:52,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:59:52,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:59:52,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:52,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:52,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:59:52,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:52,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:52,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:52,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:59:52,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:52,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:59:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:52,444 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:59:52,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:52,491 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 33 transitions. Complement of second has 9 states. [2025-03-17 19:59:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2025-03-17 19:59:52,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 1 letters. Loop has 3 letters. [2025-03-17 19:59:52,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:52,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2025-03-17 19:59:52,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:52,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 1 letters. Loop has 6 letters. [2025-03-17 19:59:52,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:52,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 33 transitions. [2025-03-17 19:59:52,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:59:52,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 28 transitions. [2025-03-17 19:59:52,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 19:59:52,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-17 19:59:52,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2025-03-17 19:59:52,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:52,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-03-17 19:59:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2025-03-17 19:59:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-17 19:59:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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-03-17 19:59:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2025-03-17 19:59:52,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2025-03-17 19:59:52,531 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2025-03-17 19:59:52,531 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:59:52,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2025-03-17 19:59:52,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:59:52,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:52,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:52,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:59:52,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:52,533 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 19:59:52,533 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1468, now seen corresponding path program 1 times [2025-03-17 19:59:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528474541] [2025-03-17 19:59:52,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:52,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:52,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528474541] [2025-03-17 19:59:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528474541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:59:52,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:59:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:59:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794317043] [2025-03-17 19:59:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:59:52,608 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 1 times [2025-03-17 19:59:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723989532] [2025-03-17 19:59:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:52,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:52,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:52,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:52,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:52,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:52,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:59:52,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:59:52,667 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 12 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 19:59:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:52,688 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-03-17 19:59:52,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2025-03-17 19:59:52,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 19:59:52,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 33 transitions. [2025-03-17 19:59:52,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-17 19:59:52,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 19:59:52,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2025-03-17 19:59:52,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:52,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-17 19:59:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2025-03-17 19:59:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2025-03-17 19:59:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-03-17 19:59:52,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-17 19:59:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:59:52,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-17 19:59:52,692 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:59:52,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-03-17 19:59:52,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 19:59:52,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:52,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:52,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:59:52,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:52,693 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-03-17 19:59:52,694 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-03-17 19:59:52,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2025-03-17 19:59:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484714977] [2025-03-17 19:59:52,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:52,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:52,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:52,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:52,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 43632, now seen corresponding path program 1 times [2025-03-17 19:59:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005862480] [2025-03-17 19:59:52,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:52,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:52,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:52,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:52,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:52,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:52,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 43866193, now seen corresponding path program 1 times [2025-03-17 19:59:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001638856] [2025-03-17 19:59:52,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:52,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:52,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:52,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:52,974 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:52,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:52,974 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:52,974 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:52,975 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:52,975 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:52,975 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:52,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:52,975 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration3_Lasso [2025-03-17 19:59:52,975 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:52,975 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:52,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:52,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:52,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:53,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:53,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:53,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:53,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:53,304 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:53,304 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,307 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:59:53,308 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-03-17 19:59:53,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:53,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:53,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:53,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:59:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,327 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:59:53,328 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-03-17 19:59:53,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:53,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:53,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:53,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:59:53,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,348 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:59:53,350 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-03-17 19:59:53,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:53,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:53,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:59:53,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,372 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:59:53,375 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-03-17 19:59:53,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:53,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:53,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,401 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:59:53,405 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-03-17 19:59:53,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,417 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:59:53,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,423 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 19:59:53,423 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:59:53,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:53,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,442 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:59:53,444 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-03-17 19:59:53,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:53,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:53,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:59:53,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,467 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:59:53,469 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-03-17 19:59:53,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:53,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:53,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:53,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,492 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:59:53,494 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-03-17 19:59:53,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:53,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:53,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:53,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:53,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,516 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:59:53,519 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-03-17 19:59:53,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:53,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:53,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:53,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:53,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:53,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:53,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:53,556 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 19:59:53,556 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:59:53,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,558 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:59:53,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:53,572 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:59:53,572 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:53,572 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 99998 Supporting invariants [] [2025-03-17 19:59:53,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:59:53,593 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 19:59:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:53,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:53,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:59:53,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:53,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:53,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:59:53,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:53,629 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-03-17 19:59:53,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03-17 19:59:53,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 22 states and 29 transitions. Complement of second has 7 states. [2025-03-17 19:59:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03-17 19:59:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2025-03-17 19:59:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-17 19:59:53,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-17 19:59:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:53,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-17 19:59:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:53,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-03-17 19:59:53,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:53,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 27 transitions. [2025-03-17 19:59:53,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:59:53,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 19:59:53,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2025-03-17 19:59:53,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:53,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-17 19:59:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2025-03-17 19:59:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-17 19:59:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-03-17 19:59:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2025-03-17 19:59:53,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-17 19:59:53,645 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-17 19:59:53,645 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:59:53,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2025-03-17 19:59:53,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:53,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:53,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:53,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:53,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:53,646 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 19:59:53,646 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:53,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash 43866189, now seen corresponding path program 1 times [2025-03-17 19:59:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:53,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039359398] [2025-03-17 19:59:53,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:53,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:53,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:53,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:53,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039359398] [2025-03-17 19:59:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039359398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980819129] [2025-03-17 19:59:53,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,694 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 19:59:53,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:53,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:53,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:59:53,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:53,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980819129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:53,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 19:59:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793646219] [2025-03-17 19:59:53,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:53,751 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 2 times [2025-03-17 19:59:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835109294] [2025-03-17 19:59:53,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:53,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:53,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:53,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:59:53,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:53,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:53,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:53,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:53,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:53,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:59:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:59:53,796 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:53,838 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2025-03-17 19:59:53,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 87 transitions. [2025-03-17 19:59:53,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:53,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 60 states and 76 transitions. [2025-03-17 19:59:53,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-17 19:59:53,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-17 19:59:53,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2025-03-17 19:59:53,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:53,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2025-03-17 19:59:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2025-03-17 19:59:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2025-03-17 19:59:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 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-03-17 19:59:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-03-17 19:59:53,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-17 19:59:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:59:53,843 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-17 19:59:53,843 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:59:53,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2025-03-17 19:59:53,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:53,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:53,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:53,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1] [2025-03-17 19:59:53,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:53,845 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 19:59:53,845 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:53,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1417679484, now seen corresponding path program 2 times [2025-03-17 19:59:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:53,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542569701] [2025-03-17 19:59:53,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:53,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 19:59:53,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:59:53,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:59:53,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542569701] [2025-03-17 19:59:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542569701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381430042] [2025-03-17 19:59:53,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:53,954 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:53,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 19:59:53,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 19:59:53,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:59:53,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:59:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:59:53,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:54,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:54,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381430042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:54,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:54,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 19:59:54,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071575139] [2025-03-17 19:59:54,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:54,063 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:54,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 3 times [2025-03-17 19:59:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:54,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260090375] [2025-03-17 19:59:54,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:59:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:54,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:54,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:54,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:59:54,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:54,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:54,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:54,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:54,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:54,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:54,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:54,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:59:54,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:59:54,096 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:54,174 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2025-03-17 19:59:54,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 202 transitions. [2025-03-17 19:59:54,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:54,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 144 states and 178 transitions. [2025-03-17 19:59:54,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-03-17 19:59:54,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-03-17 19:59:54,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 178 transitions. [2025-03-17 19:59:54,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:54,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 178 transitions. [2025-03-17 19:59:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 178 transitions. [2025-03-17 19:59:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2025-03-17 19:59:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 91 states have internal predecessors, (116), 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-03-17 19:59:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2025-03-17 19:59:54,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 116 transitions. [2025-03-17 19:59:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:59:54,183 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 116 transitions. [2025-03-17 19:59:54,183 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:59:54,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 116 transitions. [2025-03-17 19:59:54,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:54,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:54,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:54,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1] [2025-03-17 19:59:54,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:54,185 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 19:59:54,185 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:54,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash 557484444, now seen corresponding path program 3 times [2025-03-17 19:59:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659110852] [2025-03-17 19:59:54,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:59:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:54,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 11 equivalence classes. [2025-03-17 19:59:54,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:59:54,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:59:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:54,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659110852] [2025-03-17 19:59:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659110852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885790483] [2025-03-17 19:59:54,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:59:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:54,374 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:54,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 19:59:54,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 11 equivalence classes. [2025-03-17 19:59:54,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:59:54,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:59:54,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:54,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:59:54,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:54,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885790483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:54,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-17 19:59:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982601146] [2025-03-17 19:59:54,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:54,696 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 4 times [2025-03-17 19:59:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848746356] [2025-03-17 19:59:54,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:59:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:54,698 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 19:59:54,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:54,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:59:54,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:54,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:54,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:54,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:54,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:54,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:54,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:54,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:59:54,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:59:54,740 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 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-03-17 19:59:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:54,951 INFO L93 Difference]: Finished difference Result 336 states and 430 transitions. [2025-03-17 19:59:54,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 336 states and 430 transitions. [2025-03-17 19:59:54,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:54,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 336 states to 312 states and 382 transitions. [2025-03-17 19:59:54,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2025-03-17 19:59:54,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2025-03-17 19:59:54,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 382 transitions. [2025-03-17 19:59:54,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:54,958 INFO L218 hiAutomatonCegarLoop]: Abstraction has 312 states and 382 transitions. [2025-03-17 19:59:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 382 transitions. [2025-03-17 19:59:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2025-03-17 19:59:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 1.24) internal successors, (248), 199 states have internal predecessors, (248), 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-03-17 19:59:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-03-17 19:59:54,965 INFO L240 hiAutomatonCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-03-17 19:59:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:59:54,966 INFO L432 stractBuchiCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-03-17 19:59:54,966 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:59:54,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 248 transitions. [2025-03-17 19:59:54,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:54,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:54,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:54,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1] [2025-03-17 19:59:54,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:54,968 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 19:59:54,969 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:54,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -868818980, now seen corresponding path program 4 times [2025-03-17 19:59:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842533449] [2025-03-17 19:59:54,969 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:59:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:54,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-17 19:59:55,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:59:55,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:59:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842533449] [2025-03-17 19:59:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842533449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124105407] [2025-03-17 19:59:55,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:59:55,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:55,530 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:55,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 19:59:55,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-17 19:59:55,608 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:59:55,609 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:59:55,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:55,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:59:55,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:55,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124105407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:56,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 19:59:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163616104] [2025-03-17 19:59:56,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:56,293 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 5 times [2025-03-17 19:59:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239803243] [2025-03-17 19:59:56,293 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:59:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:56,295 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:56,296 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:56,296 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:59:56,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:56,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:56,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:56,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:56,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:56,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:56,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 19:59:56,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 19:59:56,326 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. cyclomatic complexity: 51 Second operand has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 47 states have internal predecessors, (136), 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-03-17 19:59:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:56,763 INFO L93 Difference]: Finished difference Result 696 states and 886 transitions. [2025-03-17 19:59:56,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 696 states and 886 transitions. [2025-03-17 19:59:56,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:56,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 696 states to 648 states and 790 transitions. [2025-03-17 19:59:56,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2025-03-17 19:59:56,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2025-03-17 19:59:56,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 648 states and 790 transitions. [2025-03-17 19:59:56,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:56,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 648 states and 790 transitions. [2025-03-17 19:59:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states and 790 transitions. [2025-03-17 19:59:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 416. [2025-03-17 19:59:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 1.2307692307692308) internal successors, (512), 415 states have internal predecessors, (512), 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-03-17 19:59:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 512 transitions. [2025-03-17 19:59:56,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 416 states and 512 transitions. [2025-03-17 19:59:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 19:59:56,789 INFO L432 stractBuchiCegarLoop]: Abstraction has 416 states and 512 transitions. [2025-03-17 19:59:56,789 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:59:56,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 416 states and 512 transitions. [2025-03-17 19:59:56,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:56,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:56,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:56,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1] [2025-03-17 19:59:56,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:56,793 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 19:59:56,795 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 19:59:56,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash -976933796, now seen corresponding path program 5 times [2025-03-17 19:59:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:56,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603105973] [2025-03-17 19:59:56,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:59:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:56,821 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 47 equivalence classes. [2025-03-17 19:59:56,939 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 19:59:56,939 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 19:59:56,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603105973] [2025-03-17 19:59:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603105973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765112835] [2025-03-17 19:59:58,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:59:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:58,379 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:58,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 19:59:58,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 47 equivalence classes. [2025-03-17 20:00:57,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 20:00:57,780 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 20:00:57,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:57,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 20:00:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:57,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:00:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765112835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:00:59,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:00:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 20:00:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642074325] [2025-03-17 20:00:59,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:00:59,902 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 6 times [2025-03-17 20:00:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-17 20:00:59,903 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:00:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:59,905 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:00:59,906 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:00:59,906 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:00:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:59,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:59,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:00:59,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:00:59,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:59,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:59,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:59,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:59,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 20:00:59,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 20:00:59,935 INFO L87 Difference]: Start difference. First operand 416 states and 512 transitions. cyclomatic complexity: 99 Second operand has 96 states, 95 states have (on average 2.9473684210526314) internal successors, (280), 95 states have internal predecessors, (280), 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-03-17 20:01:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:01,806 INFO L93 Difference]: Finished difference Result 1416 states and 1798 transitions. [2025-03-17 20:01:01,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1416 states and 1798 transitions. [2025-03-17 20:01:01,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:01:01,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1416 states to 1320 states and 1606 transitions. [2025-03-17 20:01:01,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 569 [2025-03-17 20:01:01,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 569 [2025-03-17 20:01:01,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1320 states and 1606 transitions. [2025-03-17 20:01:01,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:01,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2025-03-17 20:01:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states and 1606 transitions. [2025-03-17 20:01:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 848. [2025-03-17 20:01:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 848 states have (on average 1.2264150943396226) internal successors, (1040), 847 states have internal predecessors, (1040), 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-03-17 20:01:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1040 transitions. [2025-03-17 20:01:01,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 848 states and 1040 transitions. [2025-03-17 20:01:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 20:01:01,834 INFO L432 stractBuchiCegarLoop]: Abstraction has 848 states and 1040 transitions. [2025-03-17 20:01:01,834 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:01:01,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 848 states and 1040 transitions. [2025-03-17 20:01:01,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:01:01,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:01,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:01,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1] [2025-03-17 20:01:01,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:01:01,844 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(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc 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);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-03-17 20:01:01,844 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-03-17 20:01:01,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 251151708, now seen corresponding path program 6 times [2025-03-17 20:01:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:01,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996487345] [2025-03-17 20:01:01,845 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:01,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:01,882 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 284 statements into 95 equivalence classes. [2025-03-17 20:01:02,078 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 284 of 284 statements. [2025-03-17 20:01:02,078 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 20:01:02,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996487345] [2025-03-17 20:01:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996487345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158192613] [2025-03-17 20:01:06,568 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:06,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:06,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:06,570 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:06,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 20:01:06,693 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 284 statements into 95 equivalence classes.