./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/reducercommutativity/sum10-1.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 f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:10:28,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:10:28,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:10:28,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:10:28,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:10:28,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:10:28,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:10:28,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:10:28,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:10:28,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:10:28,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:10:28,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:10:28,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:10:28,524 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:10:28,524 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:10:28,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:10:28,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:10:28,526 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:10:28,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:10:28,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:10:28,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:10:28,527 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:10:28,527 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 -> f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 [2025-02-06 19:10:28,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:10:28,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:10:28,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:10:28,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:10:28,770 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:10:28,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum10-1.i [2025-02-06 19:10:29,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74a7a465/75d9c827bdff443eb83d5e875e7d8c32/FLAGa511cd3aa [2025-02-06 19:10:30,214 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:10:30,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2025-02-06 19:10:30,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74a7a465/75d9c827bdff443eb83d5e875e7d8c32/FLAGa511cd3aa [2025-02-06 19:10:30,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74a7a465/75d9c827bdff443eb83d5e875e7d8c32 [2025-02-06 19:10:30,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:10:30,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:10:30,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:10:30,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:10:30,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:10:30,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30, skipping insertion in model container [2025-02-06 19:10:30,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:10:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:10:30,652 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:10:30,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:10:30,679 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:10:30,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30 WrapperNode [2025-02-06 19:10:30,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:10:30,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:10:30,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:10:30,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:10:30,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,708 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-02-06 19:10:30,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:10:30,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:10:30,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:10:30,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:10:30,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,728 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-02-06 19:10:30,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:10:30,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:10:30,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:10:30,743 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:10:30,744 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (1/1) ... [2025-02-06 19:10:30,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:30,776 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-02-06 19:10:30,778 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-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:10:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:10:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:10:30,850 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:10:30,852 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:10:30,970 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-02-06 19:10:30,977 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 19:10:30,977 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:10:30,982 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:10:30,982 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:10:30,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:10:30 BoogieIcfgContainer [2025-02-06 19:10:30,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:10:30,983 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:10:30,983 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:10:30,987 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:10:30,987 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:30,988 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:10:30" (1/3) ... [2025-02-06 19:10:30,988 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@795a31ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:10:30, skipping insertion in model container [2025-02-06 19:10:30,988 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:30,988 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:30" (2/3) ... [2025-02-06 19:10:30,989 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@795a31ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:10:30, skipping insertion in model container [2025-02-06 19:10:30,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:30,989 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:10:30" (3/3) ... [2025-02-06 19:10:30,990 INFO L363 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2025-02-06 19:10:31,019 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:10:31,020 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:10:31,020 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:10:31,020 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:10:31,020 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:10:31,020 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:10:31,020 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:10:31,020 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:10:31,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:31,032 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-02-06 19:10:31,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:31,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:31,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:10:31,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:31,036 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:10:31,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:31,037 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-02-06 19:10:31,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:31,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:31,037 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:10:31,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:31,040 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" [2025-02-06 19:10:31,040 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-02-06 19:10:31,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 1 times [2025-02-06 19:10:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017602519] [2025-02-06 19:10:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:31,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:31,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:31,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:31,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:31,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:31,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:31,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:31,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 55, now seen corresponding path program 1 times [2025-02-06 19:10:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515973198] [2025-02-06 19:10:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:31,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:31,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:31,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:31,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:31,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:31,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:31,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:31,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 55576, now seen corresponding path program 1 times [2025-02-06 19:10:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649822916] [2025-02-06 19:10:31,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:31,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:31,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:31,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:31,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:31,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:31,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:31,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:31,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:31,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:31,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:31,370 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:31,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:31,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:31,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:31,371 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:31,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:31,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:31,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2025-02-06 19:10:31,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:31,371 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:31,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:31,770 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:31,772 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:31,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,775 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-02-06 19:10:31,776 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-02-06 19:10:31,778 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-02-06 19:10:31,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,801 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-02-06 19:10:31,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,806 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-02-06 19:10:31,808 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-02-06 19:10:31,811 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-02-06 19:10:31,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:31,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,827 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-02-06 19:10:31,831 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-02-06 19:10:31,831 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-02-06 19:10:31,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:31,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:31,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:31,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,855 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-02-06 19:10:31,859 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-02-06 19:10:31,863 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-02-06 19:10:31,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:31,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:31,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:10:31,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,887 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-02-06 19:10:31,888 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-02-06 19:10:31,888 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-02-06 19:10:31,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:10:31,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,908 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-02-06 19:10:31,909 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-02-06 19:10:31,911 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-02-06 19:10:31,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,928 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-02-06 19:10:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,930 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-02-06 19:10:31,932 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-02-06 19:10:31,932 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-02-06 19:10:31,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:10:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,953 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-02-06 19:10:31,954 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-02-06 19:10:31,956 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-02-06 19:10:31,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,973 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-02-06 19:10:31,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,975 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-02-06 19:10:31,976 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-02-06 19:10:31,978 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-02-06 19:10:31,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:31,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:31,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:31,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:31,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:31,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:31,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:31,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:31,995 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-02-06 19:10:31,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:31,996 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-02-06 19:10:31,999 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-02-06 19:10:31,999 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-02-06 19:10:32,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:32,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:32,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:32,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:32,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,019 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-02-06 19:10:32,020 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-02-06 19:10:32,021 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-02-06 19:10:32,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:32,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:32,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:32,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,038 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-02-06 19:10:32,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:32,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:10:32,043 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-02-06 19:10:32,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:32,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:32,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:32,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,062 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:32,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:10:32,065 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-02-06 19:10:32,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:32,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:32,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:32,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:32,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,084 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:32,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:10:32,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:32,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:32,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:32,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:32,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,108 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:32,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:10:32,115 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-02-06 19:10:32,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:32,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:32,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:10:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,140 INFO L229 MonitoredProcess]: Starting monitored process 17 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-02-06 19:10:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:10:32,142 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-02-06 19:10:32,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:32,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:32,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:32,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:10:32,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,165 INFO L229 MonitoredProcess]: Starting monitored process 18 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-02-06 19:10:32,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:10:32,166 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-02-06 19:10:32,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:32,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:32,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:32,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:32,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:32,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:32,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:32,202 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-02-06 19:10:32,204 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-06 19:10:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,211 INFO L229 MonitoredProcess]: Starting monitored process 19 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-02-06 19:10:32,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:10:32,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:32,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:32,229 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:32,230 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-02-06 19:10:32,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:10:32,248 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:10:32,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:10:32,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:10:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:32,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:32,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:32,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,307 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-02-06 19:10:32,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:32,330 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 27 transitions. Complement of second has 3 states. [2025-02-06 19:10:32,331 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-02-06 19:10:32,333 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-02-06 19:10:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-02-06 19:10:32,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-06 19:10:32,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:32,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:10:32,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:32,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-06 19:10:32,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:32,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. [2025-02-06 19:10:32,339 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 17 transitions. [2025-02-06 19:10:32,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:32,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:32,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2025-02-06 19:10:32,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:32,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 17 transitions. [2025-02-06 19:10:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2025-02-06 19:10:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-02-06 19:10:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-02-06 19:10:32,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-02-06 19:10:32,355 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-02-06 19:10:32,355 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:10:32,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-02-06 19:10:32,355 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:32,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:32,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:10:32,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:32,355 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" [2025-02-06 19:10:32,356 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:32,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 55575, now seen corresponding path program 1 times [2025-02-06 19:10:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690543867] [2025-02-06 19:10:32,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:32,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:32,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:32,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690543867] [2025-02-06 19:10:32,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690543867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:32,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:10:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256298778] [2025-02-06 19:10:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:32,397 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2025-02-06 19:10:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990318395] [2025-02-06 19:10:32,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:32,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:32,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:10:32,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:10:32,439 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 10 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-02-06 19:10:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:32,444 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-02-06 19:10:32,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-02-06 19:10:32,449 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-02-06 19:10:32,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:32,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:32,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-02-06 19:10:32,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:32,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-06 19:10:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-02-06 19:10:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-06 19:10:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-02-06 19:10:32,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-06 19:10:32,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:10:32,451 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-06 19:10:32,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:10:32,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-02-06 19:10:32,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:32,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:32,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:10:32,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:32,451 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" [2025-02-06 19:10:32,452 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:32,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1722879, now seen corresponding path program 1 times [2025-02-06 19:10:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66897249] [2025-02-06 19:10:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:32,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:32,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66897249] [2025-02-06 19:10:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66897249] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176457910] [2025-02-06 19:10:32,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,495 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:32,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 19:10:32,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:32,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:32,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:10:32,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176457910] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:32,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:32,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 19:10:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122149533] [2025-02-06 19:10:32,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:32,554 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:32,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2025-02-06 19:10:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378280961] [2025-02-06 19:10:32,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:32,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:32,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:32,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:10:32,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:10:32,592 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 9 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-02-06 19:10:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:32,602 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-02-06 19:10:32,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-02-06 19:10:32,602 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2025-02-06 19:10:32,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:32,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:32,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-02-06 19:10:32,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:32,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:10:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-02-06 19:10:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 19:10:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-06 19:10:32,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:10:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:10:32,604 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:10:32,604 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:10:32,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-02-06 19:10:32,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:32,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:32,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-02-06 19:10:32,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:32,604 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" [2025-02-06 19:10:32,605 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:32,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash -213265641, now seen corresponding path program 2 times [2025-02-06 19:10:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419546589] [2025-02-06 19:10:32,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:10:32,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:10:32,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419546589] [2025-02-06 19:10:32,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419546589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352573523] [2025-02-06 19:10:32,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:32,722 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:32,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 19:10:32,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:10:32,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:10:32,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:32,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:32,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:32,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:32,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352573523] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:32,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 19:10:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860481149] [2025-02-06 19:10:32,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:32,853 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:32,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 3 times [2025-02-06 19:10:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-02-06 19:10:32,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:10:32,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:32,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:32,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:32,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:10:32,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:10:32,912 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:32,932 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-02-06 19:10:32,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2025-02-06 19:10:32,932 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2025-02-06 19:10:32,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:32,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:32,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2025-02-06 19:10:32,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:32,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-06 19:10:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2025-02-06 19:10:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-06 19:10:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-02-06 19:10:32,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-06 19:10:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:10:32,935 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-06 19:10:32,935 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:10:32,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2025-02-06 19:10:32,936 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-02-06 19:10:32,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:32,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:32,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-02-06 19:10:32,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:32,936 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" [2025-02-06 19:10:32,936 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2068245015, now seen corresponding path program 3 times [2025-02-06 19:10:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-06 19:10:32,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:32,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-02-06 19:10:32,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:32,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:10:32,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:32,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:32,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:10:32,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:32,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:32,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:33,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:33,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 4 times [2025-02-06 19:10:33,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:33,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735229502] [2025-02-06 19:10:33,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:33,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:33,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:10:33,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:33,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:33,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:33,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:33,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:33,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:33,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:33,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -308913953, now seen corresponding path program 1 times [2025-02-06 19:10:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322039021] [2025-02-06 19:10:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:33,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:33,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:10:33,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:33,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:33,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:33,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:33,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:10:33,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:33,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:33,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:33,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:36,416 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:36,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:36,416 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:36,416 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:36,416 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:36,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:36,416 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:36,416 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:36,416 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration5_Lasso [2025-02-06 19:10:36,416 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:36,416 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:36,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:36,935 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:36,936 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:36,938 INFO L229 MonitoredProcess]: Starting monitored process 22 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-02-06 19:10:36,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:10:36,940 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-02-06 19:10:36,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:36,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:36,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:36,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:36,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:36,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:36,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:36,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:36,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:36,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:36,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:36,959 INFO L229 MonitoredProcess]: Starting monitored process 23 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-02-06 19:10:36,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:10:36,964 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-02-06 19:10:36,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:36,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:36,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:36,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:36,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:36,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:36,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:36,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:36,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:10:36,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:36,984 INFO L229 MonitoredProcess]: Starting monitored process 24 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-02-06 19:10:36,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:10:36,986 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-02-06 19:10:36,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:36,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:36,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:36,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:36,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:36,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:36,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:36,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,006 INFO L229 MonitoredProcess]: Starting monitored process 25 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-02-06 19:10:37,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:10:37,008 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-02-06 19:10:37,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,027 INFO L229 MonitoredProcess]: Starting monitored process 26 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-02-06 19:10:37,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:10:37,029 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-02-06 19:10:37,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:10:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,049 INFO L229 MonitoredProcess]: Starting monitored process 27 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-02-06 19:10:37,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:10:37,051 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-02-06 19:10:37,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,073 INFO L229 MonitoredProcess]: Starting monitored process 28 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-02-06 19:10:37,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:10:37,075 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-02-06 19:10:37,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:10:37,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,106 INFO L229 MonitoredProcess]: Starting monitored process 29 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-02-06 19:10:37,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:10:37,108 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-02-06 19:10:37,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,130 INFO L229 MonitoredProcess]: Starting monitored process 30 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-02-06 19:10:37,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:10:37,133 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-02-06 19:10:37,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:10:37,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,153 INFO L229 MonitoredProcess]: Starting monitored process 31 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-02-06 19:10:37,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:10:37,155 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-02-06 19:10:37,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-06 19:10:37,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,187 INFO L229 MonitoredProcess]: Starting monitored process 32 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-02-06 19:10:37,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:10:37,190 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-02-06 19:10:37,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-06 19:10:37,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,215 INFO L229 MonitoredProcess]: Starting monitored process 33 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-02-06 19:10:37,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:10:37,217 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-02-06 19:10:37,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:10:37,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,237 INFO L229 MonitoredProcess]: Starting monitored process 34 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-02-06 19:10:37,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:10:37,239 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-02-06 19:10:37,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-06 19:10:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,273 INFO L229 MonitoredProcess]: Starting monitored process 35 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-02-06 19:10:37,276 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-02-06 19:10:37,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:10:37,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:10:37,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,296 INFO L229 MonitoredProcess]: Starting monitored process 36 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-02-06 19:10:37,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:10:37,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:37,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,321 INFO L229 MonitoredProcess]: Starting monitored process 37 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-02-06 19:10:37,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:10:37,324 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-02-06 19:10:37,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:10:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,353 INFO L229 MonitoredProcess]: Starting monitored process 38 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-02-06 19:10:37,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:10:37,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:37,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 19:10:37,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,376 INFO L229 MonitoredProcess]: Starting monitored process 39 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-02-06 19:10:37,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:10:37,379 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-02-06 19:10:37,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-06 19:10:37,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,400 INFO L229 MonitoredProcess]: Starting monitored process 40 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-02-06 19:10:37,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 19:10:37,402 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-02-06 19:10:37,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,429 INFO L229 MonitoredProcess]: Starting monitored process 41 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-02-06 19:10:37,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 19:10:37,432 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-02-06 19:10:37,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:10:37,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,453 INFO L229 MonitoredProcess]: Starting monitored process 42 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-02-06 19:10:37,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:10:37,455 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-02-06 19:10:37,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:37,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:37,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:37,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:37,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,481 INFO L229 MonitoredProcess]: Starting monitored process 43 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-02-06 19:10:37,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:10:37,483 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-02-06 19:10:37,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:37,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:37,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:37,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:37,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:37,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:37,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:37,515 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:37,515 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-02-06 19:10:37,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:37,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,523 INFO L229 MonitoredProcess]: Starting monitored process 44 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-02-06 19:10:37,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:10:37,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:37,538 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:37,538 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:37,538 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x#1.base)_1, ULTIMATE.start_sum_~i~0#1) = 19*v_rep(select #length ULTIMATE.start_sum_~x#1.base)_1 - 8*ULTIMATE.start_sum_~i~0#1 Supporting invariants [] [2025-02-06 19:10:37,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-06 19:10:37,559 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:10:37,560 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:10:37,560 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:10:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:37,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:10:37,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:37,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:37,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:37,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:37,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:37,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:37,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:37,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:37,611 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-02-06 19:10:37,611 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-02-06 19:10:37,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 20 states and 25 transitions. Complement of second has 3 states. [2025-02-06 19:10:37,618 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-02-06 19:10:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-02-06 19:10:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-02-06 19:10:37,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 13 letters. Loop has 1 letters. [2025-02-06 19:10:37,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:37,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2025-02-06 19:10:37,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:37,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-06 19:10:37,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:37,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2025-02-06 19:10:37,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:37,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2025-02-06 19:10:37,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:10:37,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:37,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2025-02-06 19:10:37,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:37,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-06 19:10:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2025-02-06 19:10:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-06 19:10:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-06 19:10:37,622 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-06 19:10:37,622 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-06 19:10:37,622 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:10:37,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-02-06 19:10:37,622 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:37,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:37,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:37,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-02-06 19:10:37,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:37,623 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume !(sum_~i~0#1 < 10);sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" [2025-02-06 19:10:37,623 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:37,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -986397963, now seen corresponding path program 1 times [2025-02-06 19:10:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:37,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001692483] [2025-02-06 19:10:37,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:37,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:10:37,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:10:37,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:10:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001692483] [2025-02-06 19:10:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001692483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:37,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:37,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:10:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308831215] [2025-02-06 19:10:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:37,673 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:37,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-02-06 19:10:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-02-06 19:10:37,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:37,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:37,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:37,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:37,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:10:37,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:10:37,710 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:37,721 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-02-06 19:10:37,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2025-02-06 19:10:37,721 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:37,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2025-02-06 19:10:37,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:10:37,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:37,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2025-02-06 19:10:37,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:37,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-06 19:10:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2025-02-06 19:10:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-02-06 19:10:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-06 19:10:37,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-06 19:10:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:10:37,724 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-06 19:10:37,724 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:10:37,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2025-02-06 19:10:37,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:37,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:37,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:37,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:37,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:37,725 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume !(sum_~i~0#1 < 10);sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:37,725 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:37,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1259362293, now seen corresponding path program 1 times [2025-02-06 19:10:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274935796] [2025-02-06 19:10:37,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:37,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:10:37,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:37,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:10:37,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:37,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274935796] [2025-02-06 19:10:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274935796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:37,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763316183] [2025-02-06 19:10:37,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:37,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:37,783 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:37,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-02-06 19:10:37,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:10:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:37,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:37,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:10:37,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:10:37,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:10:37,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763316183] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:37,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 19:10:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847511481] [2025-02-06 19:10:37,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:37,861 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:37,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 2 times [2025-02-06 19:10:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:37,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095708850] [2025-02-06 19:10:37,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:37,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:37,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:37,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:37,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:37,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:37,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:37,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:37,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:37,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:37,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:10:37,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:10:37,916 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:37,943 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-02-06 19:10:37,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2025-02-06 19:10:37,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:37,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2025-02-06 19:10:37,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:10:37,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:10:37,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2025-02-06 19:10:37,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:37,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-02-06 19:10:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2025-02-06 19:10:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-02-06 19:10:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-02-06 19:10:37,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-02-06 19:10:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:10:37,947 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-02-06 19:10:37,947 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:10:37,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2025-02-06 19:10:37,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:37,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:37,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:37,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 19:10:37,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:37,948 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume !(sum_~i~0#1 < 10);sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:37,948 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:37,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1643423477, now seen corresponding path program 2 times [2025-02-06 19:10:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:37,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606340896] [2025-02-06 19:10:37,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:37,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 19:10:37,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:37,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:37,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:10:38,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606340896] [2025-02-06 19:10:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606340896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006436689] [2025-02-06 19:10:38,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:38,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:38,054 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:38,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-02-06 19:10:38,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 19:10:38,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:38,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:38,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:38,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:38,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:10:38,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:10:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006436689] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:38,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:38,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 19:10:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472776049] [2025-02-06 19:10:38,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:38,185 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:38,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,185 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 3 times [2025-02-06 19:10:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501329205] [2025-02-06 19:10:38,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:10:38,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:38,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:10:38,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:10:38,230 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:38,291 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-06 19:10:38,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2025-02-06 19:10:38,292 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:38,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2025-02-06 19:10:38,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-02-06 19:10:38,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-06 19:10:38,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2025-02-06 19:10:38,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:38,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-06 19:10:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2025-02-06 19:10:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-02-06 19:10:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-02-06 19:10:38,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-02-06 19:10:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:10:38,295 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-02-06 19:10:38,295 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:10:38,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2025-02-06 19:10:38,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-02-06 19:10:38,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:38,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:38,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-02-06 19:10:38,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:38,297 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume !(sum_~i~0#1 < 10);sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:38,297 INFO L754 eck$LassoCheckResult]: Loop: "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" [2025-02-06 19:10:38,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1583285003, now seen corresponding path program 3 times [2025-02-06 19:10:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404307977] [2025-02-06 19:10:38,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:38,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-02-06 19:10:38,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:38,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:10:38,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:10:38,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:38,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 4 times [2025-02-06 19:10:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62490533] [2025-02-06 19:10:38,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:10:38,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1837194819, now seen corresponding path program 4 times [2025-02-06 19:10:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213049459] [2025-02-06 19:10:38,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-02-06 19:10:38,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 36 statements. [2025-02-06 19:10:38,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:10:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-06 19:10:38,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213049459] [2025-02-06 19:10:38,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213049459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:38,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:38,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 19:10:38,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399878963] [2025-02-06 19:10:38,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:38,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:10:38,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:10:38,789 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:38,845 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-02-06 19:10:38,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2025-02-06 19:10:38,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:10:38,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 38 states and 39 transitions. [2025-02-06 19:10:38,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:10:38,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 19:10:38,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2025-02-06 19:10:38,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:38,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-02-06 19:10:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2025-02-06 19:10:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 19:10:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-02-06 19:10:38,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-02-06 19:10:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 19:10:38,849 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-02-06 19:10:38,849 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:10:38,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2025-02-06 19:10:38,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:10:38,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:38,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:38,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:38,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:38,851 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(10, 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_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume !(sum_~i~0#1 < 10);sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume sum_~i~0#1 < 10;call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1;sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1;" "assume !(sum_~i~0#1 < 10);sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret8#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0;" [2025-02-06 19:10:38,851 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~2#1 < 9;call main_#t~mem10#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem10#1;main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-02-06 19:10:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1118464557, now seen corresponding path program 1 times [2025-02-06 19:10:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612062957] [2025-02-06 19:10:38,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:10:38,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:10:38,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:10:38,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:10:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-02-06 19:10:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498235750] [2025-02-06 19:10:38,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash -312662885, now seen corresponding path program 1 times [2025-02-06 19:10:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-02-06 19:10:38,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:10:39,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:10:39,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:39,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:39,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:10:39,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:10:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:39,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:55,051 WARN L286 SmtUtils]: Spent 15.86s on a formula simplification. DAG size of input: 535 DAG size of output: 404 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:10:58,427 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:58,428 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:58,428 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:58,428 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:58,428 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:58,428 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:58,428 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:58,428 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:58,428 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration10_Lasso [2025-02-06 19:10:58,428 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:58,428 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:58,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true