./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.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_assert_loop_dep.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 fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:59:47,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:59:47,981 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:47,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:59:47,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:59:47,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:59:48,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:59:48,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:59:48,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:59:48,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:59:48,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:59:48,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:59:48,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:59:48,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:59:48,007 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:59:48,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:59:48,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:59:48,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:59:48,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:59:48,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:59:48,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:59:48,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:59:48,010 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:59:48,010 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 -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2025-03-17 19:59:48,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:59:48,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:59:48,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:59:48,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:59:48,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:59:48,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2025-03-17 19:59:49,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ebc591d/22ab1b07b4474049b9abc22a3ea6f82a/FLAGd43b9aed2 [2025-03-17 19:59:49,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:59:49,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2025-03-17 19:59:49,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ebc591d/22ab1b07b4474049b9abc22a3ea6f82a/FLAGd43b9aed2 [2025-03-17 19:59:49,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ebc591d/22ab1b07b4474049b9abc22a3ea6f82a [2025-03-17 19:59:49,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:59:49,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:59:49,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:59:49,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:59:49,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:59:49,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:59:49" (1/1) ... [2025-03-17 19:59:49,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:49, skipping insertion in model container [2025-03-17 19:59:49,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:59:49" (1/1) ... [2025-03-17 19:59:49,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:59:50,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:59:50,045 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:59:50,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:59:50,067 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:59:50,068 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,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:59:50,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:59:50,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:59:50,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:59:50,073 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,078 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,090 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-03-17 19:59:50,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:59:50,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:59:50,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:59:50,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:59:50,096 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,096 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,097 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,112 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 19:59:50,112 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,112 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,118 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,120 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,122 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,123 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,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:59:50,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:59:50,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:59:50,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:59:50,126 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,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:50,154 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,157 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,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:59:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:59:50,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:59:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:59:50,227 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:59:50,229 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:59:50,316 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 19:59:50,325 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-17 19:59:50,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:59:50,333 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:59:50,333 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:59:50,333 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,333 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:59:50,334 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:59:50,334 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:59:50,338 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:59:50,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:50,338 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:59:49" (1/3) ... [2025-03-17 19:59:50,339 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d72426e 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,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:50,339 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,339 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d72426e 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,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:50,340 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,342 INFO L363 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2025-03-17 19:59:50,377 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:59:50,377 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:59:50,377 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:59:50,378 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:59:50,378 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:59:50,378 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:59:50,378 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:59:50,378 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:59:50,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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:50,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 19:59:50,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:50,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:50,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:59:50,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:59:50,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:59:50,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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:50,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 19:59:50,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:50,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:50,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:59:50,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:59:50,397 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(24, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" [2025-03-17 19:59:50,397 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" [2025-03-17 19:59:50,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-03-17 19:59:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79482696] [2025-03-17 19:59:50,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:50,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:50,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:50,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:50,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:50,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:50,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:50,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:50,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:50,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 1 times [2025-03-17 19:59:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329165431] [2025-03-17 19:59:50,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:50,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:50,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:50,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:50,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:50,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:50,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:50,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:59:50,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:50,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:50,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:50,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2025-03-17 19:59:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097002168] [2025-03-17 19:59:50,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:50,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:50,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:50,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:50,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:50,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:50,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:50,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:50,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:50,863 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:50,863 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:50,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:50,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:50,864 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:50,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:50,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:50,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:50,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2025-03-17 19:59:50,864 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:50,864 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:50,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:50,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:51,200 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:51,203 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,206 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,208 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,209 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,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:51,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,239 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,241 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,242 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,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,267 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,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,269 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,270 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,273 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,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,297 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,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,300 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,301 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,302 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,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 19:59:51,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,324 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:51,326 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:51,327 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,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,354 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:51,355 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:51,356 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,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,377 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:51,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,379 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:51,380 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:51,381 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,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,402 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:51,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,404 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:51,404 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:51,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:51,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:59:51,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,432 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:51,434 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:51,435 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,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:51,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:51,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,457 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:51,459 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:51,460 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,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:51,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:51,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:51,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:51,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:51,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:51,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:51,499 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 19:59:51,501 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:59:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,506 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:51,507 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:51,508 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:51,520 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:59:51,520 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:51,521 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2025-03-17 19:59:51,527 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:51,540 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 19:59:51,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:59:51,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:59:51,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:51,577 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,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:51,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:59:51,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:51,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:59:51,588 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,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:51,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:59:51,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:51,591 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:51,608 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 19:59:51,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 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:51,629 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 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) Result 14 states and 20 transitions. Complement of second has 3 states. [2025-03-17 19:59:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 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:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 19:59:51,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 19:59:51,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:51,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 19:59:51,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:51,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 19:59:51,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:51,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2025-03-17 19:59:51,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:51,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 11 states and 16 transitions. [2025-03-17 19:59:51,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:59:51,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:59:51,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-03-17 19:59:51,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:51,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-17 19:59:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-03-17 19:59:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-17 19:59:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-03-17 19:59:51,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 19:59:51,656 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 19:59:51,656 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:59:51,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-03-17 19:59:51,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:51,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:51,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:51,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:59:51,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:51,657 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(24, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~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:51,657 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2025-03-17 19:59:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1471, now seen corresponding path program 1 times [2025-03-17 19:59:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938692885] [2025-03-17 19:59:51,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:51,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:51,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:51,715 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:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938692885] [2025-03-17 19:59:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938692885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:59:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:59:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:59:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578045357] [2025-03-17 19:59:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:59:51,718 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:51,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 40999302, now seen corresponding path program 1 times [2025-03-17 19:59:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994206102] [2025-03-17 19:59:51,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:51,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:51,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:51,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:51,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:51,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:51,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:59:51,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:59:51,843 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 7 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:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:51,855 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-03-17 19:59:51,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2025-03-17 19:59:51,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:51,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2025-03-17 19:59:51,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 19:59:51,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 19:59:51,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2025-03-17 19:59:51,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:51,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-17 19:59:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2025-03-17 19:59:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-17 19:59:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 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:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-17 19:59:51,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-17 19:59:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:59:51,858 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-17 19:59:51,858 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:59:51,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-03-17 19:59:51,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:51,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:51,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:51,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:59:51,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:51,858 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(24, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:51,858 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:51,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -794234357, now seen corresponding path program 1 times [2025-03-17 19:59:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941404460] [2025-03-17 19:59:51,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:59:51,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:59:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:51,898 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:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941404460] [2025-03-17 19:59:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941404460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105628469] [2025-03-17 19:59:51,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:51,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:51,900 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:51,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 19:59:51,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:59:51,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:59:51,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:51,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:51,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:59:51,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:51,954 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:51,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:51,968 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:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105628469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:51,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 19:59:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736215955] [2025-03-17 19:59:51,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:51,971 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 32722272, now seen corresponding path program 2 times [2025-03-17 19:59:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332413506] [2025-03-17 19:59:51,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:51,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:51,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:51,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:59:51,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:51,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:51,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:59:51,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:52,003 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,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:52,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:59:52,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:59:52,103 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:52,145 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-17 19:59:52,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2025-03-17 19:59:52,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:52,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 30 transitions. [2025-03-17 19:59:52,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 19:59:52,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 19:59:52,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2025-03-17 19:59:52,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:52,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-17 19:59:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2025-03-17 19:59:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-03-17 19:59:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-17 19:59:52,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-17 19:59:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:59:52,150 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-17 19:59:52,150 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:59:52,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2025-03-17 19:59:52,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:52,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:52,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:52,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 19:59:52,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:52,153 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(24, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:52,153 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 518134149, now seen corresponding path program 1 times [2025-03-17 19:59:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137665532] [2025-03-17 19:59:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:59:52,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:59:52,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:59:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:52,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137665532] [2025-03-17 19:59:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137665532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:52,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326896546] [2025-03-17 19:59:52,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:52,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,292 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:52,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:59:52,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:59:52,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:59:52,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:59:52,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:59:52,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:59:52,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326896546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:52,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:52,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 19:59:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341132429] [2025-03-17 19:59:52,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:52,404 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 32722272, now seen corresponding path program 3 times [2025-03-17 19:59:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545935860] [2025-03-17 19:59:52,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:59:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:52,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:52,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:59:52,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:52,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:52,420 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,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:52,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:52,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:52,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:59:52,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:59:52,509 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:52,590 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-03-17 19:59:52,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2025-03-17 19:59:52,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 19:59:52,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 69 transitions. [2025-03-17 19:59:52,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-03-17 19:59:52,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-17 19:59:52,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2025-03-17 19:59:52,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:52,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-03-17 19:59:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2025-03-17 19:59:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2025-03-17 19:59:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.048780487804878) internal successors, (43), 40 states have internal predecessors, (43), 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,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-03-17 19:59:52,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-03-17 19:59:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:59:52,602 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-03-17 19:59:52,602 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:59:52,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 43 transitions. [2025-03-17 19:59:52,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:52,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:52,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:52,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 5, 5, 5, 5, 4, 1, 1] [2025-03-17 19:59:52,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:52,604 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(24, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:52,604 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:52,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1066782308, now seen corresponding path program 2 times [2025-03-17 19:59:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:52,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874233226] [2025-03-17 19:59:52,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:52,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 19:59:52,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:59:52,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:59:52,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:59:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874233226] [2025-03-17 19:59:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874233226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682845697] [2025-03-17 19:59:52,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:52,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:52,915 INFO L229 MonitoredProcess]: Starting monitored process 15 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:52,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 19:59:52,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 19:59:52,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:59:52,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:59:52,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:52,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:59:52,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:59:53,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:59:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:59:53,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682845697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:59:53,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:59:53,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-17 19:59:53,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396418519] [2025-03-17 19:59:53,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:59:53,178 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 32722272, now seen corresponding path program 4 times [2025-03-17 19:59:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174399975] [2025-03-17 19:59:53,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:59:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:53,182 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 19:59:53,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:53,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:59:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:53,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:53,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:53,188 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,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:53,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:53,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:59:53,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:59:53,273 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:53,448 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-03-17 19:59:53,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 147 transitions. [2025-03-17 19:59:53,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2025-03-17 19:59:53,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 147 transitions. [2025-03-17 19:59:53,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-03-17 19:59:53,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-03-17 19:59:53,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 147 transitions. [2025-03-17 19:59:53,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:53,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-03-17 19:59:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 147 transitions. [2025-03-17 19:59:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2025-03-17 19:59:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 82 states have internal predecessors, (85), 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,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2025-03-17 19:59:53,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 85 transitions. [2025-03-17 19:59:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:59:53,456 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2025-03-17 19:59:53,456 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:59:53,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 85 transitions. [2025-03-17 19:59:53,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:59:53,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:53,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:53,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 11, 11, 11, 11, 10, 1, 1] [2025-03-17 19:59:53,458 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:53,458 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(24, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem2#1, main_#t~post3#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 100000;call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:53,458 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < 100000;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 { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2#1;" "assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4);" [2025-03-17 19:59:53,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -322832964, now seen corresponding path program 3 times [2025-03-17 19:59:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947581586] [2025-03-17 19:59:53,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:59:53,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:53,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 12 equivalence classes. [2025-03-17 19:59:53,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 78 statements. [2025-03-17 19:59:53,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:59:53,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-17 19:59:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947581586] [2025-03-17 19:59:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947581586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:59:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:59:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:59:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122749233] [2025-03-17 19:59:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:59:53,555 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash 32722272, now seen corresponding path program 5 times [2025-03-17 19:59:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:53,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294106449] [2025-03-17 19:59:53,555 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:59:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:53,558 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:53,560 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:53,560 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:59:53,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:53,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:53,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:53,562 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,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:53,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:53,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:53,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:59:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:59:53,639 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:53,659 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-03-17 19:59:53,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 31 transitions. [2025-03-17 19:59:53,659 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:59:53,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2025-03-17 19:59:53,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:59:53,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:59:53,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:59:53,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:53,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:59:53,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:59:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:59:53,660 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:59:53,660 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:59:53,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:59:53,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:59:53,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:59:53,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:59:53 BoogieIcfgContainer [2025-03-17 19:59:53,669 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:59:53,669 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:59:53,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:59:53,670 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:59:53,670 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:59:50" (3/4) ... [2025-03-17 19:59:53,671 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:59:53,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:59:53,673 INFO L158 Benchmark]: Toolchain (without parser) took 3751.93ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 62.2MB in the end (delta: 48.2MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2025-03-17 19:59:53,674 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:59:53,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.37ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 99.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:59:53,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.94ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:59:53,674 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:59:53,674 INFO L158 Benchmark]: IcfgBuilder took 209.27ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 85.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:59:53,676 INFO L158 Benchmark]: BuchiAutomizer took 3334.99ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 63.5MB in the end (delta: 21.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2025-03-17 19:59:53,677 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 62.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:59:53,678 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.37ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 99.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.94ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 209.27ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 85.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3334.99ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 63.5MB in the end (delta: 21.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 62.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 196 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 26 mSDtfsCounter, 196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital117 mio100 ax100 hnf100 lsp88 ukn75 mio100 lsp43 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:59:53,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:53,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:54,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:54,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE