./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:10:26,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:10:26,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:10:26,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:10:26,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:10:26,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:10:26,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:10:26,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:10:26,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:10:26,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:10:26,780 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:10:26,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:10:26,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:10:26,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:10:26,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:10:26,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:10:26,781 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:10:26,782 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2025-01-10 07:10:27,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:10:27,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:10:27,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:10:27,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:10:27,011 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:10:27,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-01-10 07:10:28,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a2c95905/700e75815de148418edf79bdb5fe44f7/FLAG177f92c86 [2025-01-10 07:10:28,450 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:10:28,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-01-10 07:10:28,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a2c95905/700e75815de148418edf79bdb5fe44f7/FLAG177f92c86 [2025-01-10 07:10:28,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a2c95905/700e75815de148418edf79bdb5fe44f7 [2025-01-10 07:10:28,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:10:28,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:10:28,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:28,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:10:28,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:10:28,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:28" (1/1) ... [2025-01-10 07:10:28,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea24f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:28, skipping insertion in model container [2025-01-10 07:10:28,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:28" (1/1) ... [2025-01-10 07:10:28,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:10:28,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:28,973 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:10:28,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:29,011 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:10:29,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29 WrapperNode [2025-01-10 07:10:29,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:29,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:29,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:10:29,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:10:29,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,047 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 146 [2025-01-10 07:10:29,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:29,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:10:29,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:10:29,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:10:29,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,076 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-01-10 07:10:29,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:10:29,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:10:29,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:10:29,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:10:29,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (1/1) ... [2025-01-10 07:10:29,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:29,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:29,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:10:29,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:10:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:10:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:10:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:10:29,218 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:10:29,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:10:29,455 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-10 07:10:29,455 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:10:29,462 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:10:29,462 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:10:29,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:29 BoogieIcfgContainer [2025-01-10 07:10:29,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:10:29,464 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:10:29,464 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:10:29,468 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:10:29,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:29,469 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:10:28" (1/3) ... [2025-01-10 07:10:29,470 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ebb21e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:29, skipping insertion in model container [2025-01-10 07:10:29,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:29,471 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:29" (2/3) ... [2025-01-10 07:10:29,471 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ebb21e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:29, skipping insertion in model container [2025-01-10 07:10:29,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:29,471 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:29" (3/3) ... [2025-01-10 07:10:29,473 INFO L363 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2025-01-10 07:10:29,514 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:10:29,514 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:10:29,514 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:10:29,514 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:10:29,514 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:10:29,514 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:10:29,514 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:10:29,514 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:10:29,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:29,530 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2025-01-10 07:10:29,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:29,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:29,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:29,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:29,535 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:10:29,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:29,538 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2025-01-10 07:10:29,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:29,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:29,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:29,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:29,545 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" [2025-01-10 07:10:29,545 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:29,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:10:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997219106] [2025-01-10 07:10:29,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:29,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:29,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:29,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:29,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:29,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:29,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:29,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:29,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:29,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 07:10:29,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:29,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-01-10 07:10:29,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:29,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:29,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:29,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:29,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:29,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:29,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:29,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:29,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:29,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:10:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156358942] [2025-01-10 07:10:29,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:29,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:29,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:29,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:29,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:29,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:29,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:30,028 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:30,030 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:30,030 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:30,030 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:30,030 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:30,031 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,031 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:30,031 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:30,031 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2025-01-10 07:10:30,031 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:30,031 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:30,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,493 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:30,495 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:30,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:10:30,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:30,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:30,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:30,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:30,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:30,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:30,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:30,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:30,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:30,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:10:30,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:10:30,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:30,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:30,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:30,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:30,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:30,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:30,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:30,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:30,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:30,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:10:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:10:30,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:30,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:30,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:30,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:30,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:30,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:30,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:30,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:30,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:10:30,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:10:30,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:30,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:30,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:30,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:30,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:30,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:30,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:30,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:30,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:10:30,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:30,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:30,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:30,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:30,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:30,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:30,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:30,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:30,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:30,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:10:30,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:30,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:30,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:30,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:30,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:30,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:30,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:30,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:30,713 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-01-10 07:10:30,715 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-01-10 07:10:30,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:30,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:30,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:10:30,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:30,733 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:30,733 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:30,733 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2025-01-10 07:10:30,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:30,768 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-01-10 07:10:30,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:10:30,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:10:30,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:30,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:30,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:30,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:30,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:30,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:30,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:30,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:30,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:30,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:30,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:30,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:30,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:30,866 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:10:30,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:30,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 56 transitions. Complement of second has 3 states. [2025-01-10 07:10:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:10:30,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 07:10:30,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:30,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:10:30,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:30,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:10:30,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:30,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2025-01-10 07:10:30,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2025-01-10 07:10:30,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 53 transitions. [2025-01-10 07:10:30,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-01-10 07:10:30,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-01-10 07:10:30,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 53 transitions. [2025-01-10 07:10:30,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:30,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 53 transitions. [2025-01-10 07:10:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 53 transitions. [2025-01-10 07:10:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-01-10 07:10:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2025-01-10 07:10:30,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 51 transitions. [2025-01-10 07:10:30,932 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 51 transitions. [2025-01-10 07:10:30,932 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:10:30,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 51 transitions. [2025-01-10 07:10:30,933 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2025-01-10 07:10:30,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:30,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:30,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:10:30,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:10:30,933 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" [2025-01-10 07:10:30,933 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 < main_~n~0#1;main_~y~0#1 := 1 + main_~x~0#1;" "assume !(main_~y~0#1 < main_~n~0#1);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-01-10 07:10:30,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 07:10:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:30,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329897696] [2025-01-10 07:10:30,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:30,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:30,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:30,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:30,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:30,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:30,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329897696] [2025-01-10 07:10:30,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329897696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:10:30,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:10:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:10:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149074294] [2025-01-10 07:10:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:10:30,973 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:30,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1367, now seen corresponding path program 1 times [2025-01-10 07:10:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295379350] [2025-01-10 07:10:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:30,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:30,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:30,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:30,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:30,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:30,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:30,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:30,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:30,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:30,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:30,996 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:30,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:30,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:30,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:30,996 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:10:30,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:30,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:30,996 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:30,996 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2025-01-10 07:10:30,996 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:30,996 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:30,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:31,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:31,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:31,025 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:31,026 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:10:31,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:31,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:31,029 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:31,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:10:31,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:10:31,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:10:31,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:31,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:31,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:31,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:10:31,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:10:31,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:10:31,139 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:10:31,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:31,144 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:31,144 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:31,144 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:31,144 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:31,144 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:31,144 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:31,144 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:31,144 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:31,144 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2025-01-10 07:10:31,144 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:31,144 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:31,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:31,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:31,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:31,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:31,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:31,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:31,177 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:10:31,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:31,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:31,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:31,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:31,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:31,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:31,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:31,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:31,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:31,198 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:10:31,198 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:10:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:31,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:31,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:31,207 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:10:31,207 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:31,207 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-01-10 07:10:31,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:10:31,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:10:31,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:10:31,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:31,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:31,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:31,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:31,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:31,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:31,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:31,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:31,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:31,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:10:31,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,273 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:10:31,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 51 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 51 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 107 transitions. Complement of second has 6 states. [2025-01-10 07:10:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-01-10 07:10:31,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 2 letters. [2025-01-10 07:10:31,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:31,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:10:31,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:31,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 4 letters. [2025-01-10 07:10:31,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:31,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 107 transitions. [2025-01-10 07:10:31,314 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2025-01-10 07:10:31,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 36 states and 56 transitions. [2025-01-10 07:10:31,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-01-10 07:10:31,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-01-10 07:10:31,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 56 transitions. [2025-01-10 07:10:31,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:31,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 56 transitions. [2025-01-10 07:10:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 56 transitions. [2025-01-10 07:10:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-01-10 07:10:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2025-01-10 07:10:31,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 53 transitions. [2025-01-10 07:10:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:31,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:10:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:10:31,318 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:31,352 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2025-01-10 07:10:31,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2025-01-10 07:10:31,353 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 29 [2025-01-10 07:10:31,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 60 transitions. [2025-01-10 07:10:31,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-01-10 07:10:31,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-01-10 07:10:31,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2025-01-10 07:10:31,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:31,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-01-10 07:10:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2025-01-10 07:10:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2025-01-10 07:10:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2025-01-10 07:10:31,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-01-10 07:10:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:10:31,356 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-01-10 07:10:31,356 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:10:31,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2025-01-10 07:10:31,357 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-01-10 07:10:31,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:31,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:31,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:10:31,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:31,357 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:10:31,357 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-01-10 07:10:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 28694783, now seen corresponding path program 1 times [2025-01-10 07:10:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-01-10 07:10:31,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:31,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:31,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:31,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:31,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-01-10 07:10:31,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332857584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:31,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837279440] [2025-01-10 07:10:31,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:31,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:31,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:31,401 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:31,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 07:10:31,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:31,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:31,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:31,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:10:31,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837279440] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:31,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 07:10:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248313885] [2025-01-10 07:10:31,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:31,459 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:31,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2025-01-10 07:10:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528811034] [2025-01-10 07:10:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:31,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:31,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:31,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:31,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:31,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:31,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:31,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:10:31,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:10:31,498 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:31,569 INFO L93 Difference]: Finished difference Result 90 states and 126 transitions. [2025-01-10 07:10:31,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 126 transitions. [2025-01-10 07:10:31,570 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 59 [2025-01-10 07:10:31,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 126 transitions. [2025-01-10 07:10:31,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-01-10 07:10:31,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-01-10 07:10:31,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 126 transitions. [2025-01-10 07:10:31,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:31,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-01-10 07:10:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 126 transitions. [2025-01-10 07:10:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 31. [2025-01-10 07:10:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2025-01-10 07:10:31,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-01-10 07:10:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:10:31,580 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-01-10 07:10:31,580 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:10:31,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2025-01-10 07:10:31,580 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-01-10 07:10:31,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:31,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:31,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2025-01-10 07:10:31,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:31,581 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:10:31,581 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-01-10 07:10:31,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash 145053727, now seen corresponding path program 2 times [2025-01-10 07:10:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-01-10 07:10:31,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:31,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 07:10:31,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:10:31,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:31,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-01-10 07:10:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411652019] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561370982] [2025-01-10 07:10:31,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:31,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:31,716 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:31,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 07:10:31,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 07:10:31,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:10:31,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:31,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:31,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:31,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561370982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:31,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 07:10:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646812706] [2025-01-10 07:10:31,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:31,843 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 2 times [2025-01-10 07:10:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-01-10 07:10:31,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:31,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:31,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:31,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:31,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:31,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:31,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:31,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:31,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:31,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:31,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:31,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:10:31,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:10:31,899 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 20 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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-01-10 07:10:32,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:32,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:32,113 INFO L93 Difference]: Finished difference Result 186 states and 258 transitions. [2025-01-10 07:10:32,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 258 transitions. [2025-01-10 07:10:32,115 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 119 [2025-01-10 07:10:32,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 258 transitions. [2025-01-10 07:10:32,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2025-01-10 07:10:32,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2025-01-10 07:10:32,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 258 transitions. [2025-01-10 07:10:32,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:32,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 258 transitions. [2025-01-10 07:10:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 258 transitions. [2025-01-10 07:10:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 37. [2025-01-10 07:10:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-01-10 07:10:32,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-01-10 07:10:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:10:32,127 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-01-10 07:10:32,127 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:10:32,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2025-01-10 07:10:32,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-01-10 07:10:32,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:32,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:32,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1] [2025-01-10 07:10:32,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:32,128 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:10:32,128 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-01-10 07:10:32,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -855921633, now seen corresponding path program 3 times [2025-01-10 07:10:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-01-10 07:10:32,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:32,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:32,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 6 equivalence classes. [2025-01-10 07:10:32,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:10:32,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:32,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:32,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:32,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-01-10 07:10:32,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64727775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:32,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551563904] [2025-01-10 07:10:32,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:32,394 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:32,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 07:10:32,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 6 equivalence classes. [2025-01-10 07:10:32,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:10:32,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:32,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:10:32,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:32,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551563904] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:32,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-10 07:10:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644681] [2025-01-10 07:10:32,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:32,700 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 3 times [2025-01-10 07:10:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140322089] [2025-01-10 07:10:32,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:32,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:32,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:32,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:10:32,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:32,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:32,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:32,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:32,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 07:10:32,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 07:10:32,750 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:33,106 INFO L93 Difference]: Finished difference Result 378 states and 522 transitions. [2025-01-10 07:10:33,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 522 transitions. [2025-01-10 07:10:33,108 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 239 [2025-01-10 07:10:33,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 378 states and 522 transitions. [2025-01-10 07:10:33,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2025-01-10 07:10:33,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 265 [2025-01-10 07:10:33,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 522 transitions. [2025-01-10 07:10:33,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:33,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 378 states and 522 transitions. [2025-01-10 07:10:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 522 transitions. [2025-01-10 07:10:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 49. [2025-01-10 07:10:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2025-01-10 07:10:33,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2025-01-10 07:10:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:10:33,116 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2025-01-10 07:10:33,116 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:10:33,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2025-01-10 07:10:33,116 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-01-10 07:10:33,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:33,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:33,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 1, 1, 1, 1] [2025-01-10 07:10:33,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:33,117 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:10:33,117 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-01-10 07:10:33,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash -172272609, now seen corresponding path program 4 times [2025-01-10 07:10:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240864650] [2025-01-10 07:10:33,117 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:33,134 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 07:10:33,147 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:10:33,147 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:33,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:33,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:33,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240864650] [2025-01-10 07:10:33,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240864650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:33,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115913383] [2025-01-10 07:10:33,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:33,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:33,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,595 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:33,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 07:10:33,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 07:10:33,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:10:33,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:33,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:33,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:10:33,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:33,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115913383] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:34,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:34,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-01-10 07:10:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260366633] [2025-01-10 07:10:34,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:34,385 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:34,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 4 times [2025-01-10 07:10:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:34,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251068612] [2025-01-10 07:10:34,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:34,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-01-10 07:10:34,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:34,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:34,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:34,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:34,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:34,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:34,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:34,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:34,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:34,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 07:10:34,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 07:10:34,423 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. cyclomatic complexity: 20 Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:35,443 INFO L93 Difference]: Finished difference Result 762 states and 1050 transitions. [2025-01-10 07:10:35,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 762 states and 1050 transitions. [2025-01-10 07:10:35,448 INFO L131 ngComponentsAnalysis]: Automaton has 96 accepting balls. 479 [2025-01-10 07:10:35,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 762 states to 762 states and 1050 transitions. [2025-01-10 07:10:35,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2025-01-10 07:10:35,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2025-01-10 07:10:35,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 762 states and 1050 transitions. [2025-01-10 07:10:35,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:35,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 762 states and 1050 transitions. [2025-01-10 07:10:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states and 1050 transitions. [2025-01-10 07:10:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 73. [2025-01-10 07:10:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 72 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-01-10 07:10:35,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-01-10 07:10:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:10:35,473 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-01-10 07:10:35,473 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:10:35,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 87 transitions. [2025-01-10 07:10:35,474 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-01-10 07:10:35,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:35,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:35,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 1, 1, 1, 1] [2025-01-10 07:10:35,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:35,478 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:10:35,479 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-01-10 07:10:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1116120095, now seen corresponding path program 5 times [2025-01-10 07:10:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:35,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880076352] [2025-01-10 07:10:35,479 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:35,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 24 equivalence classes. [2025-01-10 07:10:35,678 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 07:10:35,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:10:35,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880076352] [2025-01-10 07:10:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880076352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865959318] [2025-01-10 07:10:37,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,094 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 07:10:37,177 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 24 equivalence classes. [2025-01-10 07:10:50,530 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 07:10:50,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:10:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:50,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:10:50,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:50,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865959318] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:52,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2025-01-10 07:10:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550475108] [2025-01-10 07:10:52,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:52,836 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:52,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 5 times [2025-01-10 07:10:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:52,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224817692] [2025-01-10 07:10:52,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:52,841 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:52,842 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:52,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:52,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:52,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:52,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:52,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:52,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 07:10:52,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 07:10:52,891 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. cyclomatic complexity: 20 Second operand has 96 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:58,363 INFO L93 Difference]: Finished difference Result 1530 states and 2106 transitions. [2025-01-10 07:10:58,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1530 states and 2106 transitions. [2025-01-10 07:10:58,371 INFO L131 ngComponentsAnalysis]: Automaton has 192 accepting balls. 959 [2025-01-10 07:10:58,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1530 states to 1530 states and 2106 transitions. [2025-01-10 07:10:58,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1057 [2025-01-10 07:10:58,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1057 [2025-01-10 07:10:58,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1530 states and 2106 transitions. [2025-01-10 07:10:58,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:58,377 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1530 states and 2106 transitions. [2025-01-10 07:10:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states and 2106 transitions. [2025-01-10 07:10:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 121. [2025-01-10 07:10:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.115702479338843) internal successors, (135), 120 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2025-01-10 07:10:58,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 135 transitions. [2025-01-10 07:10:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 07:10:58,389 INFO L432 stractBuchiCegarLoop]: Abstraction has 121 states and 135 transitions. [2025-01-10 07:10:58,389 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:10:58,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 135 transitions. [2025-01-10 07:10:58,389 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-01-10 07:10:58,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:58,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:58,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 1, 1, 1, 1] [2025-01-10 07:10:58,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:58,391 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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:10:58,391 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-01-10 07:10:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 558711839, now seen corresponding path program 6 times [2025-01-10 07:10:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268805339] [2025-01-10 07:10:58,392 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:10:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:58,445 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 98 statements into 48 equivalence classes. [2025-01-10 07:10:58,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 07:10:58,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-01-10 07:10:58,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:11:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:11:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:11:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268805339] [2025-01-10 07:11:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268805339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:11:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876434120] [2025-01-10 07:11:02,812 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:11:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:11:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:11:02,815 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:11:02,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 07:11:03,043 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 98 statements into 48 equivalence classes.