./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-10 07:12:03,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:12:03,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:12:03,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:12:03,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:12:03,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:12:03,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:12:03,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:12:03,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:12:03,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:12:03,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:12:03,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:12:03,678 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:12:03,679 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:12:03,679 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:12:03,679 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:12:03,679 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:12:03,679 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:12:03,679 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:12:03,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:12:03,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:12:03,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:12:03,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:12:03,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:12:03,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:12:03,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:12:03,681 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:12:03,682 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-01-10 07:12:03,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:12:03,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:12:03,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:12:03,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:12:03,901 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:12:03,901 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-01-10 07:12:05,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a43740ec/83e4eef076c54398aa6a7909ceb4fdb8/FLAG1a532dc43 [2025-01-10 07:12:05,305 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:12:05,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2025-01-10 07:12:05,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a43740ec/83e4eef076c54398aa6a7909ceb4fdb8/FLAG1a532dc43 [2025-01-10 07:12:05,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a43740ec/83e4eef076c54398aa6a7909ceb4fdb8 [2025-01-10 07:12:05,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:12:05,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:12:05,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:12:05,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:12:05,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:12:05,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ad6b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05, skipping insertion in model container [2025-01-10 07:12:05,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:12:05,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:12:05,750 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:12:05,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:12:05,778 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:12:05,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05 WrapperNode [2025-01-10 07:12:05,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:12:05,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:12:05,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:12:05,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:12:05,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,808 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-01-10 07:12:05,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:12:05,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:12:05,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:12:05,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:12:05,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,830 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-01-10 07:12:05,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:12:05,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:12:05,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:12:05,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:12:05,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (1/1) ... [2025-01-10 07:12:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:05,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:05,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:05,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:12:05,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:12:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:12:05,965 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:12:05,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:12:06,122 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-10 07:12:06,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:12:06,130 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:12:06,130 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:12:06,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:06 BoogieIcfgContainer [2025-01-10 07:12:06,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:12:06,132 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:12:06,132 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:12:06,135 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:12:06,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:12:06,136 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:12:05" (1/3) ... [2025-01-10 07:12:06,137 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3adb235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:12:06, skipping insertion in model container [2025-01-10 07:12:06,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:12:06,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:05" (2/3) ... [2025-01-10 07:12:06,138 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3adb235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:12:06, skipping insertion in model container [2025-01-10 07:12:06,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:12:06,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:06" (3/3) ... [2025-01-10 07:12:06,139 INFO L363 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2025-01-10 07:12:06,178 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:12:06,178 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:12:06,179 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:12:06,179 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:12:06,179 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:12:06,179 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:12:06,179 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:12:06,180 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:12:06,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:06,191 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-01-10 07:12:06,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:06,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:06,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:12:06,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:06,194 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:12:06,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:06,195 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-01-10 07:12:06,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:06,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:06,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:12:06,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:06,200 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-01-10 07:12:06,200 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-01-10 07:12:06,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:12:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642395598] [2025-01-10 07:12:06,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:06,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:12:06,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:12:06,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:06,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:06,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:06,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:12:06,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:12:06,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:06,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:06,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:06,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 07:12:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169321441] [2025-01-10 07:12:06,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:06,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:06,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:06,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:06,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:06,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:06,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:06,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:12:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244451859] [2025-01-10 07:12:06,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:06,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:06,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:06,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:06,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:06,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:06,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:06,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:06,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:06,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:06,556 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:06,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:06,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:06,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:06,556 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:06,557 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:06,557 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:06,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:06,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2025-01-10 07:12:06,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:06,557 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:06,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:06,905 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:06,907 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:06,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:06,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:06,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:12:06,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:06,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:06,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:06,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:06,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:06,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:06,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:06,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:06,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:06,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:12:06,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:06,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:06,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:06,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:12:06,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:06,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:06,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:06,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:06,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:06,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:06,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:06,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:06,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:06,981 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-01-10 07:12:06,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:06,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:06,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:12:06,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:06,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:06,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:06,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:06,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:12:07,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,043 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-01-10 07:12:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:12:07,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:12:07,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:12:07,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:12:07,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:12:07,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:12:07,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:12:07,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:12:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,190 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:12:07,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:12:07,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,215 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:12:07,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,236 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-01-10 07:12:07,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:12:07,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:12:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:12:07,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,286 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-01-10 07:12:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,288 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:12:07,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:07,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:07,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:07,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:12:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,314 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-01-10 07:12:07,316 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-01-10 07:12:07,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,344 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-01-10 07:12:07,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,346 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-01-10 07:12:07,355 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-01-10 07:12:07,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-01-10 07:12:07,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,381 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-01-10 07:12:07,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,384 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-01-10 07:12:07,386 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-01-10 07:12:07,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:12:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,415 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:12:07,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:07,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,441 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:12:07,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:07,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:07,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:07,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:07,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:07,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:07,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:07,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:07,494 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:12:07,497 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-01-10 07:12:07,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:07,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,503 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-01-10 07:12:07,505 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-01-10 07:12:07,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:07,519 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:07,520 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:07,520 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-01-10 07:12:07,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:07,544 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-01-10 07:12:07,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:12:07,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:12:07,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:07,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:12:07,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:12:07,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:07,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:12:07,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:07,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:07,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:07,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:07,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:12:07,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:07,629 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:12:07,630 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:07,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 27 transitions. Complement of second has 3 states. [2025-01-10 07:12:07,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:12:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:12:07,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 07:12:07,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:07,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:12:07,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:07,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:12:07,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:07,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. [2025-01-10 07:12:07,671 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:07,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 17 transitions. [2025-01-10 07:12:07,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:12:07,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:12:07,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2025-01-10 07:12:07,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:07,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 17 transitions. [2025-01-10 07:12:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2025-01-10 07:12:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-01-10 07:12:07,693 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-01-10 07:12:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-01-10 07:12:07,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-01-10 07:12:07,694 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-01-10 07:12:07,694 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:12:07,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-01-10 07:12:07,695 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:07,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:07,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:07,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:12:07,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:07,696 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-01-10 07:12:07,696 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-01-10 07:12:07,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 07:12:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7636420] [2025-01-10 07:12:07,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:07,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:07,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:07,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7636420] [2025-01-10 07:12:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7636420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:12:07,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:12:07,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:12:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290792456] [2025-01-10 07:12:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:12:07,759 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:07,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 1 times [2025-01-10 07:12:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113172405] [2025-01-10 07:12:07,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:07,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:07,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:07,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:07,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:07,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:07,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:07,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:07,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:12:07,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:12:07,809 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-01-10 07:12:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:07,815 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-01-10 07:12:07,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-01-10 07:12:07,815 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:07,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-01-10 07:12:07,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:12:07,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:12:07,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-01-10 07:12:07,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:07,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 07:12:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-01-10 07:12:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-01-10 07:12:07,817 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-01-10 07:12:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-01-10 07:12:07,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 07:12:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:12:07,818 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 07:12:07,818 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:12:07,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-01-10 07:12:07,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:07,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:07,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:07,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:12:07,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:07,819 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-01-10 07:12:07,819 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-01-10 07:12:07,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-10 07:12:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526021421] [2025-01-10 07:12:07,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:07,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:12:07,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:12:07,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:07,874 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-01-10 07:12:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526021421] [2025-01-10 07:12:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526021421] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896413260] [2025-01-10 07:12:07,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:07,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:07,883 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:12:07,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 07:12:07,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:12:07,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:12:07,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:07,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:12:07,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:07,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896413260] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:07,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 07:12:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173436124] [2025-01-10 07:12:07,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:07,952 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:07,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 2 times [2025-01-10 07:12:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:07,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161177866] [2025-01-10 07:12:07,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:07,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:07,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:07,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:12:07,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:07,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:07,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:07,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:07,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:07,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:07,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:08,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:12:08,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:12:08,007 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-01-10 07:12:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:08,021 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-01-10 07:12:08,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-01-10 07:12:08,021 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:08,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2025-01-10 07:12:08,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:12:08,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:12:08,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-01-10 07:12:08,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:08,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:12:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-01-10 07:12:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-10 07:12:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-01-10 07:12:08,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:12:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:12:08,023 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:12:08,023 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:12:08,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-01-10 07:12:08,023 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:08,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:08,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:08,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-01-10 07:12:08,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:08,024 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-01-10 07:12:08,024 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-01-10 07:12:08,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1805794469, now seen corresponding path program 2 times [2025-01-10 07:12:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166859574] [2025-01-10 07:12:08,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:08,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:12:08,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:12:08,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:08,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166859574] [2025-01-10 07:12:08,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166859574] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252123136] [2025-01-10 07:12:08,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:08,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:08,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:08,098 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:12:08,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-10 07:12:08,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:12:08,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:12:08,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:08,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:12:08,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:08,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252123136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:08,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 07:12:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972372324] [2025-01-10 07:12:08,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:08,201 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 3 times [2025-01-10 07:12:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501280009] [2025-01-10 07:12:08,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:12:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:08,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:08,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:08,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:12:08,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:08,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:08,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:08,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:08,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:12:08,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:12:08,238 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-01-10 07:12:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:08,253 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-01-10 07:12:08,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2025-01-10 07:12:08,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:08,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2025-01-10 07:12:08,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:12:08,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:12:08,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2025-01-10 07:12:08,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:08,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-10 07:12:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2025-01-10 07:12:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-10 07:12:08,260 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-01-10 07:12:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-10 07:12:08,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-10 07:12:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:12:08,261 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-10 07:12:08,261 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:12:08,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2025-01-10 07:12:08,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-01-10 07:12:08,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:08,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:08,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-01-10 07:12:08,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:08,262 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-01-10 07:12:08,262 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-01-10 07:12:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1496410277, now seen corresponding path program 3 times [2025-01-10 07:12:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485604798] [2025-01-10 07:12:08,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:12:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:08,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-01-10 07:12:08,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:08,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:12:08,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:08,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:08,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:08,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:08,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 4 times [2025-01-10 07:12:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696832616] [2025-01-10 07:12:08,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:12:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:08,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-01-10 07:12:08,299 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:08,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:12:08,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:08,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:08,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:08,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:08,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -855921657, now seen corresponding path program 1 times [2025-01-10 07:12:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797967783] [2025-01-10 07:12:08,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:12:08,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:12:08,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:08,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:08,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:12:08,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:12:08,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:08,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:11,689 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:11,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:11,689 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:11,689 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:11,690 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:11,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:11,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:11,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:11,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration5_Lasso [2025-01-10 07:12:11,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:11,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:11,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:11,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:12,155 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:12,156 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:12,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,158 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-01-10 07:12:12,161 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-01-10 07:12:12,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:12:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,184 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-01-10 07:12:12,198 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-01-10 07:12:12,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,219 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-01-10 07:12:12,221 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-01-10 07:12:12,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,239 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-01-10 07:12:12,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,241 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-01-10 07:12:12,242 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-01-10 07:12:12,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,260 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-01-10 07:12:12,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,262 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-01-10 07:12:12,263 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-01-10 07:12:12,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:12:12,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,287 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-01-10 07:12:12,288 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-01-10 07:12:12,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,307 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-01-10 07:12:12,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,309 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-01-10 07:12:12,310 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-01-10 07:12:12,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,328 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-01-10 07:12:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,331 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-01-10 07:12:12,332 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-01-10 07:12:12,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,350 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-01-10 07:12:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,352 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-01-10 07:12:12,353 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-01-10 07:12:12,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,372 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-01-10 07:12:12,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,374 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-01-10 07:12:12,375 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-01-10 07:12:12,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,393 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-01-10 07:12:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,399 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-01-10 07:12:12,399 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-01-10 07:12:12,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,419 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-01-10 07:12:12,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,421 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-01-10 07:12:12,423 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-01-10 07:12:12,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,440 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-01-10 07:12:12,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,442 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-01-10 07:12:12,443 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-01-10 07:12:12,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,461 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-01-10 07:12:12,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,464 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-01-10 07:12:12,465 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-01-10 07:12:12,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,489 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-01-10 07:12:12,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,493 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-01-10 07:12:12,494 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-01-10 07:12:12,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,532 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-01-10 07:12:12,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,535 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-01-10 07:12:12,535 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-01-10 07:12:12,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:12,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:12,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-01-10 07:12:12,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,563 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-01-10 07:12:12,564 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-01-10 07:12:12,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,586 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-01-10 07:12:12,590 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-01-10 07:12:12,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:12,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:12,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-01-10 07:12:12,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,629 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-01-10 07:12:12,635 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-01-10 07:12:12,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,660 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-01-10 07:12:12,661 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-01-10 07:12:12,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,683 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-01-10 07:12:12,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,688 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 07:12:12,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:12,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:12,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,715 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:12:12,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:12,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:12,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,744 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:12:12,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,768 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 07:12:12,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,793 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 07:12:12,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:12,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:12,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,823 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 07:12:12,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:12,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:12,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:12,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:12,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,846 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 07:12:12,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:12:12,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:12,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:12,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:12,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:12,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:12,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:12,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:12,924 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-01-10 07:12:12,924 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-01-10 07:12:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:12,927 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:12:12,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 07:12:12,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:12,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:12,941 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:12,941 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0#1) = -2*ULTIMATE.start_sum_~i~0#1 + 19 Supporting invariants [] [2025-01-10 07:12:12,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:12,974 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-01-10 07:12:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:13,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:13,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:12:13,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:13,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:12:13,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:13,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:12:13,111 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-01-10 07:12:13,131 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-01-10 07:12:13,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:12:13,133 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-01-10 07:12:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-01-10 07:12:13,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 13 letters. Loop has 1 letters. [2025-01-10 07:12:13,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:13,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2025-01-10 07:12:13,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:13,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 13 letters. Loop has 2 letters. [2025-01-10 07:12:13,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:13,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2025-01-10 07:12:13,138 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2025-01-10 07:12:13,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:12:13,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:12:13,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2025-01-10 07:12:13,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:13,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-10 07:12:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2025-01-10 07:12:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-10 07:12:13,139 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-01-10 07:12:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-01-10 07:12:13,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-10 07:12:13,139 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-10 07:12:13,139 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:12:13,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-01-10 07:12:13,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:13,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:13,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-01-10 07:12:13,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:13,140 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-01-10 07:12:13,140 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-01-10 07:12:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -763767513, now seen corresponding path program 1 times [2025-01-10 07:12:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944739855] [2025-01-10 07:12:13,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:12:13,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:12:13,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 07:12:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944739855] [2025-01-10 07:12:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944739855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:12:13,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:12:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:12:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888074593] [2025-01-10 07:12:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:12:13,224 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2025-01-10 07:12:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388225556] [2025-01-10 07:12:13,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:13,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:13,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:13,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:12:13,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:12:13,265 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-01-10 07:12:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:13,276 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-01-10 07:12:13,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2025-01-10 07:12:13,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2025-01-10 07:12:13,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:12:13,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:12:13,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2025-01-10 07:12:13,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:13,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-10 07:12:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2025-01-10 07:12:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-01-10 07:12:13,278 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-01-10 07:12:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-01-10 07:12:13,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-10 07:12:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:12:13,279 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-10 07:12:13,279 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:12:13,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2025-01-10 07:12:13,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:13,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:13,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:13,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:13,280 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-01-10 07:12:13,280 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-01-10 07:12:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 458766635, now seen corresponding path program 1 times [2025-01-10 07:12:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976618259] [2025-01-10 07:12:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:12:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:12:13,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 07:12:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976618259] [2025-01-10 07:12:13,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976618259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373375317] [2025-01-10 07:12:13,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:13,339 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:12:13,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-01-10 07:12:13,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 07:12:13,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:12:13,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:12:13,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:12:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 07:12:13,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 07:12:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373375317] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:13,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:13,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 07:12:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035244947] [2025-01-10 07:12:13,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:13,438 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2025-01-10 07:12:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048007762] [2025-01-10 07:12:13,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:12:13,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:13,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:13,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:13,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:13,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:12:13,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:12:13,473 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-01-10 07:12:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:13,504 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-01-10 07:12:13,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2025-01-10 07:12:13,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2025-01-10 07:12:13,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:12:13,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:12:13,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2025-01-10 07:12:13,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:13,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-01-10 07:12:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2025-01-10 07:12:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-01-10 07:12:13,507 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-01-10 07:12:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-01-10 07:12:13,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-01-10 07:12:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:12:13,508 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-01-10 07:12:13,508 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:12:13,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2025-01-10 07:12:13,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:13,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:13,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 07:12:13,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:13,508 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-01-10 07:12:13,509 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-01-10 07:12:13,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 147109671, now seen corresponding path program 2 times [2025-01-10 07:12:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656595494] [2025-01-10 07:12:13,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 07:12:13,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:12:13,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:13,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 07:12:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656595494] [2025-01-10 07:12:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656595494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899683040] [2025-01-10 07:12:13,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:13,681 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:12:13,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-01-10 07:12:13,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 07:12:13,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:12:13,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:12:13,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 07:12:13,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 07:12:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899683040] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:13,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 07:12:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264820797] [2025-01-10 07:12:13,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:13,804 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 3 times [2025-01-10 07:12:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334215209] [2025-01-10 07:12:13,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:12:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:12:13,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:13,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:13,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:13,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:13,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:13,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:13,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:12:13,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:12:13,850 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-01-10 07:12:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:13,907 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-01-10 07:12:13,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2025-01-10 07:12:13,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2025-01-10 07:12:13,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-01-10 07:12:13,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-01-10 07:12:13,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2025-01-10 07:12:13,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:13,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-01-10 07:12:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2025-01-10 07:12:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-01-10 07:12:13,910 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-01-10 07:12:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-01-10 07:12:13,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-10 07:12:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:12:13,911 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-10 07:12:13,911 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:12:13,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2025-01-10 07:12:13,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:12:13,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:13,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:13,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-01-10 07:12:13,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:13,916 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-01-10 07:12:13,917 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-01-10 07:12:13,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1609287129, now seen corresponding path program 3 times [2025-01-10 07:12:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:13,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310612] [2025-01-10 07:12:13,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:12:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:13,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-01-10 07:12:14,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:12:14,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:12:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:14,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 07:12:14,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:12:14,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:14,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 4 times [2025-01-10 07:12:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101221277] [2025-01-10 07:12:14,151 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:12:14,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:14,152 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-01-10 07:12:14,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:14,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:12:14,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:14,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:14,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:14,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:14,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1651706573, now seen corresponding path program 4 times [2025-01-10 07:12:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:14,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419628582] [2025-01-10 07:12:14,157 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:12:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:14,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-10 07:12:14,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 36 statements. [2025-01-10 07:12:14,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:12:14,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-10 07:12:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419628582] [2025-01-10 07:12:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419628582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:12:14,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:12:14,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 07:12:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885299223] [2025-01-10 07:12:14,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:12:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:14,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:12:14,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:12:14,390 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-01-10 07:12:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:14,449 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-01-10 07:12:14,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2025-01-10 07:12:14,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:12:14,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 38 states and 39 transitions. [2025-01-10 07:12:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-01-10 07:12:14,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-01-10 07:12:14,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2025-01-10 07:12:14,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:14,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-01-10 07:12:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2025-01-10 07:12:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 07:12:14,452 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-01-10 07:12:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-01-10 07:12:14,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-01-10 07:12:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 07:12:14,455 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-01-10 07:12:14,455 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:12:14,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2025-01-10 07:12:14,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:12:14,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:14,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:14,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:14,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:14,456 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-01-10 07:12:14,459 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-01-10 07:12:14,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -336703703, now seen corresponding path program 1 times [2025-01-10 07:12:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036594404] [2025-01-10 07:12:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 07:12:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 07:12:14,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 07:12:14,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 07:12:14,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:14,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times [2025-01-10 07:12:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:14,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163536763] [2025-01-10 07:12:14,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:14,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:14,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:14,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:14,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:14,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1847880173, now seen corresponding path program 1 times [2025-01-10 07:12:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990289718] [2025-01-10 07:12:14,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:14,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:12:14,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:12:14,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:14,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:12:14,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:12:14,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:14,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:14,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:28,164 WARN L286 SmtUtils]: Spent 13.37s on a formula simplification. DAG size of input: 535 DAG size of output: 401 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:12:29,957 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:29,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:29,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:29,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:29,957 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:29,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:29,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:29,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:29,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration10_Lasso [2025-01-10 07:12:29,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:29,958 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:29,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:29,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true