./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:12:09,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:12:09,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:12:09,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:12:09,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:12:09,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:12:09,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:12:09,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:12:09,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:12:09,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:12:09,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:12:09,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:12:09,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:12:09,291 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:12:09,291 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:12:09,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:12:09,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:12:09,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:12:09,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:12:09,294 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:12:09,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:12:09,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:12:09,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:12:09,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:12:09,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:12:09,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:12:09,295 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:12:09,295 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2025-02-06 19:12:09,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:12:09,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:12:09,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:12:09,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:12:09,590 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:12:09,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2025-02-06 19:12:10,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca62f80be/9b841a9306704ffdbfbf443ef126dcd1/FLAG8cdc3753b [2025-02-06 19:12:11,102 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:12:11,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2025-02-06 19:12:11,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca62f80be/9b841a9306704ffdbfbf443ef126dcd1/FLAG8cdc3753b [2025-02-06 19:12:11,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca62f80be/9b841a9306704ffdbfbf443ef126dcd1 [2025-02-06 19:12:11,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:12:11,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:12:11,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:12:11,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:12:11,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:12:11,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d819ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11, skipping insertion in model container [2025-02-06 19:12:11,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:12:11,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:12:11,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:12:11,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:12:11,380 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:12:11,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11 WrapperNode [2025-02-06 19:12:11,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:12:11,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:12:11,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:12:11,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:12:11,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,438 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2025-02-06 19:12:11,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:12:11,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:12:11,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:12:11,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:12:11,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,474 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 19:12:11,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:12:11,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:12:11,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:12:11,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:12:11,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (1/1) ... [2025-02-06 19:12:11,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:11,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:11,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:11,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:12:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:12:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:12:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:12:11,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:12:11,617 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:12:11,619 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:12:12,058 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-06 19:12:12,058 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:12:12,081 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:12:12,082 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:12:12,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:12:12 BoogieIcfgContainer [2025-02-06 19:12:12,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:12:12,083 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:12:12,083 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:12:12,088 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:12:12,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:12:12,089 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:12:11" (1/3) ... [2025-02-06 19:12:12,090 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b48db3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:12:12, skipping insertion in model container [2025-02-06 19:12:12,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:12:12,091 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:11" (2/3) ... [2025-02-06 19:12:12,092 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b48db3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:12:12, skipping insertion in model container [2025-02-06 19:12:12,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:12:12,092 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:12:12" (3/3) ... [2025-02-06 19:12:12,094 INFO L363 chiAutomizerObserver]: Analyzing ICFG byte_add_2-2.i [2025-02-06 19:12:12,135 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:12:12,135 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:12:12,135 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:12:12,136 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:12:12,136 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:12:12,137 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:12:12,137 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:12:12,137 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:12:12,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:12,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-02-06 19:12:12,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:12,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:12,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:12:12,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:12,168 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:12:12,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:12,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-02-06 19:12:12,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:12,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:12,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:12:12,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:12,186 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" [2025-02-06 19:12:12,187 INFO L754 eck$LassoCheckResult]: Loop: "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash -745943660, now seen corresponding path program 1 times [2025-02-06 19:12:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800580226] [2025-02-06 19:12:12,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:12:12,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:12:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:12,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:12:12,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:12:12,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:12,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:12,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1665910696, now seen corresponding path program 1 times [2025-02-06 19:12:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801698231] [2025-02-06 19:12:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:12:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:12:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801698231] [2025-02-06 19:12:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801698231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073748277] [2025-02-06 19:12:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:12,459 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:12,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:12,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:12,493 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 states have internal predecessors, (86), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:12,681 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2025-02-06 19:12:12,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 110 transitions. [2025-02-06 19:12:12,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2025-02-06 19:12:12,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 56 states and 86 transitions. [2025-02-06 19:12:12,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-02-06 19:12:12,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-02-06 19:12:12,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2025-02-06 19:12:12,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:12,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-02-06 19:12:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2025-02-06 19:12:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-02-06 19:12:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2025-02-06 19:12:12,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 84 transitions. [2025-02-06 19:12:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:12,742 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2025-02-06 19:12:12,743 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:12:12,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2025-02-06 19:12:12,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-02-06 19:12:12,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:12,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:12,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:12,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:12,745 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:12,745 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:12,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash 407683507, now seen corresponding path program 1 times [2025-02-06 19:12:12,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:12,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655806300] [2025-02-06 19:12:12,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:12,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:12:12,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:12:12,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:12,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655806300] [2025-02-06 19:12:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655806300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:13,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:12:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622444534] [2025-02-06 19:12:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:13,148 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 686345202, now seen corresponding path program 1 times [2025-02-06 19:12:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794054827] [2025-02-06 19:12:13,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:13,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:13,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:13,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794054827] [2025-02-06 19:12:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794054827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236581853] [2025-02-06 19:12:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:13,265 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:12:13,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:12:13,265 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:13,820 INFO L93 Difference]: Finished difference Result 197 states and 295 transitions. [2025-02-06 19:12:13,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 295 transitions. [2025-02-06 19:12:13,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2025-02-06 19:12:13,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 295 transitions. [2025-02-06 19:12:13,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2025-02-06 19:12:13,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2025-02-06 19:12:13,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 295 transitions. [2025-02-06 19:12:13,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:13,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 295 transitions. [2025-02-06 19:12:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 295 transitions. [2025-02-06 19:12:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2025-02-06 19:12:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 128 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2025-02-06 19:12:13,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 182 transitions. [2025-02-06 19:12:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:12:13,848 INFO L432 stractBuchiCegarLoop]: Abstraction has 129 states and 182 transitions. [2025-02-06 19:12:13,848 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:12:13,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 182 transitions. [2025-02-06 19:12:13,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2025-02-06 19:12:13,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:13,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:13,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:13,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:13,851 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:13,851 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1018595956, now seen corresponding path program 1 times [2025-02-06 19:12:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224023043] [2025-02-06 19:12:13,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:12:13,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:12:13,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:13,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224023043] [2025-02-06 19:12:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224023043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:12:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051242487] [2025-02-06 19:12:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:14,113 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash 686345202, now seen corresponding path program 2 times [2025-02-06 19:12:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:14,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691696072] [2025-02-06 19:12:14,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:14,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:14,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:14,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:14,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691696072] [2025-02-06 19:12:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691696072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226292514] [2025-02-06 19:12:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:14,198 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:14,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:12:14,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:12:14,199 INFO L87 Difference]: Start difference. First operand 129 states and 182 transitions. cyclomatic complexity: 56 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:14,855 INFO L93 Difference]: Finished difference Result 327 states and 486 transitions. [2025-02-06 19:12:14,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 486 transitions. [2025-02-06 19:12:14,859 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 222 [2025-02-06 19:12:14,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 327 states and 486 transitions. [2025-02-06 19:12:14,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-02-06 19:12:14,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2025-02-06 19:12:14,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 486 transitions. [2025-02-06 19:12:14,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:14,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 327 states and 486 transitions. [2025-02-06 19:12:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 486 transitions. [2025-02-06 19:12:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 192. [2025-02-06 19:12:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 192 states have (on average 1.4322916666666667) internal successors, (275), 191 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 275 transitions. [2025-02-06 19:12:14,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 192 states and 275 transitions. [2025-02-06 19:12:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:12:14,887 INFO L432 stractBuchiCegarLoop]: Abstraction has 192 states and 275 transitions. [2025-02-06 19:12:14,887 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:12:14,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 275 transitions. [2025-02-06 19:12:14,888 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 109 [2025-02-06 19:12:14,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:14,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:14,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:14,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:14,889 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume !(0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:14,889 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:14,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1954122645, now seen corresponding path program 1 times [2025-02-06 19:12:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:14,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999255561] [2025-02-06 19:12:14,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:14,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:14,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:14,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:14,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:14,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999255561] [2025-02-06 19:12:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999255561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 19:12:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199513185] [2025-02-06 19:12:15,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:15,138 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 686345202, now seen corresponding path program 3 times [2025-02-06 19:12:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33629444] [2025-02-06 19:12:15,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:12:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:15,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:15,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:15,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:12:15,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33629444] [2025-02-06 19:12:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33629444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382036982] [2025-02-06 19:12:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:15,239 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:15,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:12:15,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:12:15,239 INFO L87 Difference]: Start difference. First operand 192 states and 275 transitions. cyclomatic complexity: 87 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:15,935 INFO L93 Difference]: Finished difference Result 391 states and 574 transitions. [2025-02-06 19:12:15,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 391 states and 574 transitions. [2025-02-06 19:12:15,938 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 262 [2025-02-06 19:12:15,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 391 states to 391 states and 574 transitions. [2025-02-06 19:12:15,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2025-02-06 19:12:15,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2025-02-06 19:12:15,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 391 states and 574 transitions. [2025-02-06 19:12:15,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:15,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 391 states and 574 transitions. [2025-02-06 19:12:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states and 574 transitions. [2025-02-06 19:12:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 254. [2025-02-06 19:12:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 1.4330708661417322) internal successors, (364), 253 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 364 transitions. [2025-02-06 19:12:15,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 364 transitions. [2025-02-06 19:12:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 19:12:15,966 INFO L432 stractBuchiCegarLoop]: Abstraction has 254 states and 364 transitions. [2025-02-06 19:12:15,967 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:12:15,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 364 transitions. [2025-02-06 19:12:15,968 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 147 [2025-02-06 19:12:15,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:15,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:15,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:15,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:15,969 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:15,969 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493494, now seen corresponding path program 1 times [2025-02-06 19:12:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096320177] [2025-02-06 19:12:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:15,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:15,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:15,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:15,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:16,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096320177] [2025-02-06 19:12:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096320177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 19:12:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653613808] [2025-02-06 19:12:16,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:16,135 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 686345202, now seen corresponding path program 4 times [2025-02-06 19:12:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669877572] [2025-02-06 19:12:16,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:16,141 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:12:16,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:16,144 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:16,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669877572] [2025-02-06 19:12:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669877572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751442090] [2025-02-06 19:12:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:16,220 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:16,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:12:16,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:12:16,222 INFO L87 Difference]: Start difference. First operand 254 states and 364 transitions. cyclomatic complexity: 115 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:16,930 INFO L93 Difference]: Finished difference Result 317 states and 460 transitions. [2025-02-06 19:12:16,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 460 transitions. [2025-02-06 19:12:16,932 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 198 [2025-02-06 19:12:16,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 317 states and 460 transitions. [2025-02-06 19:12:16,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2025-02-06 19:12:16,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2025-02-06 19:12:16,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 460 transitions. [2025-02-06 19:12:16,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:16,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 317 states and 460 transitions. [2025-02-06 19:12:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 460 transitions. [2025-02-06 19:12:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2025-02-06 19:12:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 277 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2025-02-06 19:12:16,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 278 states and 400 transitions. [2025-02-06 19:12:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:12:16,951 INFO L432 stractBuchiCegarLoop]: Abstraction has 278 states and 400 transitions. [2025-02-06 19:12:16,951 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:12:16,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 400 transitions. [2025-02-06 19:12:16,953 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2025-02-06 19:12:16,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:16,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:16,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:16,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:16,955 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:16,955 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 1 times [2025-02-06 19:12:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851975262] [2025-02-06 19:12:16,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:16,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:16,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:16,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:16,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:16,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:16,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:16,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:16,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:16,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:16,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1162445480, now seen corresponding path program 5 times [2025-02-06 19:12:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:16,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902665019] [2025-02-06 19:12:16,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:17,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:17,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:17,011 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:17,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:17,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:17,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:17,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:17,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:17,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:17,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1678194404, now seen corresponding path program 1 times [2025-02-06 19:12:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774539708] [2025-02-06 19:12:17,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:17,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:12:17,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:12:17,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:17,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:17,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:17,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774539708] [2025-02-06 19:12:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774539708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:17,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99117589] [2025-02-06 19:12:17,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:17,237 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:17,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:17,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:17,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:17,238 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:12:17,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:17,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:17,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2025-02-06 19:12:17,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:17,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:17,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,516 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:17,516 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:12:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:17,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:17,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:12:17,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:17,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:17,576 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:12:17,577 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r0~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=1, ULTIMATE.start_mp_add_~a0~0#1=26879} Honda state: {ULTIMATE.start_mp_add_~r0~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=1, ULTIMATE.start_mp_add_~a0~0#1=26879} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:12:17,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:17,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:17,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:12:17,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:17,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:17,602 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:12:17,602 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:12:17,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:12:17,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:17,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:17,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:12:17,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:17,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:17,632 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:12:17,632 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~nb~0#1=0} Honda state: {ULTIMATE.start_mp_add_~nb~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:12:17,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:12:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:17,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:17,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:12:17,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:17,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:17,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:12:17,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:17,660 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:17,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:12:17,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:12:17,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:17,731 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:12:17,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:12:17,736 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:17,736 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:17,736 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:17,736 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:17,736 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:17,736 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:17,736 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:17,736 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:17,736 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2025-02-06 19:12:17,736 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:17,737 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:17,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:17,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:18,018 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:18,022 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:12:18,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:18,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:18,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:12:18,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:18,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:18,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:12:18,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,098 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:12:18,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:18,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:18,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:12:18,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:18,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:18,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:12:18,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:12:18,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:18,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:18,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,187 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-02-06 19:12:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:12:18,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,206 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,207 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,219 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:12:18,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,236 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,242 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,259 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:12:18,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,275 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,276 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,288 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:12:18,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-02-06 19:12:18,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,304 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,307 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:12:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,322 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:12:18,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,335 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,338 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,349 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-02-06 19:12:18,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,351 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:12:18,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,367 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,369 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,382 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:12:18,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,396 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,400 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:12:18,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,417 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:12:18,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,432 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,433 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,441 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-02-06 19:12:18,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,443 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-02-06 19:12:18,444 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-02-06 19:12:18,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-02-06 19:12:18,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,455 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,457 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:12:18,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,470 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-02-06 19:12:18,471 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-02-06 19:12:18,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,482 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,483 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:12:18,491 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-02-06 19:12:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:12:18,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,508 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:18,509 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:18,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:12:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:12:18,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,539 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:18,545 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:18,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:12:18,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,559 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:12:18,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,570 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:18,572 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:18,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:12:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,585 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:12:18,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,598 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:18,600 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:18,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,611 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:12:18,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:18,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,623 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:18,624 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:18,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:12:18,632 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-02-06 19:12:18,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,634 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:12:18,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,648 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,649 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:18,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,649 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,650 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,660 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:12:18,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,672 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,672 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:18,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,672 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,677 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:12:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,695 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:12:18,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,725 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,725 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:18,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,725 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,728 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,741 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:12:18,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,753 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,753 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:18,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,753 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,754 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:12:18,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,774 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:12:18,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,790 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,790 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:18,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,791 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:18,792 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:18,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-06 19:12:18,805 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-02-06 19:12:18,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,807 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:12:18,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,824 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,824 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:18,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,824 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,826 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,844 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:12:18,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,860 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,860 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:18,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,860 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,865 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,887 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:12:18,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,903 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,903 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:18,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,904 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,905 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,921 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:12:18,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,936 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,937 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:18,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,937 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,939 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:12:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,956 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:12:18,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:18,968 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:18,968 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:18,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:18,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:18,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:18,969 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:18,970 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:18,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:18,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:18,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:12:18,984 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-02-06 19:12:18,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:18,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:18,986 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:18,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:12:18,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,004 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,005 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,005 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:19,006 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:19,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:12:19,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,020 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:12:19,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,042 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,043 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,043 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:19,051 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:19,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 19:12:19,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,079 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:12:19,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,095 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,096 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,096 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:19,098 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:19,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-06 19:12:19,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,115 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 19:12:19,128 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,128 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,129 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:19,131 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:19,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,145 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-02-06 19:12:19,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,147 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 19:12:19,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,159 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,159 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,159 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:19,161 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:19,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:12:19,178 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-02-06 19:12:19,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,180 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:12:19,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,196 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,197 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:19,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,198 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:19,199 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:19,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,213 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:12:19,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,225 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,225 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:19,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,226 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:19,230 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:19,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-06 19:12:19,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,249 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:12:19,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,264 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,264 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:19,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,265 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:19,266 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:19,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-06 19:12:19,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,278 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-02-06 19:12:19,281 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-02-06 19:12:19,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,294 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,294 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:19,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,295 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:19,296 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:19,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-02-06 19:12:19,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,309 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-02-06 19:12:19,310 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-02-06 19:12:19,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-02-06 19:12:19,320 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,321 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:19,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,321 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:19,322 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:19,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-06 19:12:19,330 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-02-06 19:12:19,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,331 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-02-06 19:12:19,333 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-02-06 19:12:19,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-02-06 19:12:19,343 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,343 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,343 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:19,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:19,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:12:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,355 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-02-06 19:12:19,356 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-02-06 19:12:19,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,367 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,367 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,367 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:19,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:19,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-06 19:12:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,390 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-02-06 19:12:19,391 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-02-06 19:12:19,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,401 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,401 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,402 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:19,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:19,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-06 19:12:19,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,416 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-02-06 19:12:19,417 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-02-06 19:12:19,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-02-06 19:12:19,427 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,428 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,428 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:19,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:19,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-02-06 19:12:19,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:19,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,442 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-02-06 19:12:19,443 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-02-06 19:12:19,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:19,454 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:19,454 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:19,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:19,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:19,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:19,454 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:19,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:19,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:19,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:19,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-06 19:12:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:19,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:12:19,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:12:19,467 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. cyclomatic complexity: 128 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:19,536 INFO L93 Difference]: Finished difference Result 433 states and 615 transitions. [2025-02-06 19:12:19,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 615 transitions. [2025-02-06 19:12:19,539 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 285 [2025-02-06 19:12:19,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 615 transitions. [2025-02-06 19:12:19,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2025-02-06 19:12:19,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2025-02-06 19:12:19,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 615 transitions. [2025-02-06 19:12:19,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:19,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 615 transitions. [2025-02-06 19:12:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 615 transitions. [2025-02-06 19:12:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2025-02-06 19:12:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 425 states have (on average 1.428235294117647) internal successors, (607), 424 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 607 transitions. [2025-02-06 19:12:19,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 425 states and 607 transitions. [2025-02-06 19:12:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:12:19,553 INFO L432 stractBuchiCegarLoop]: Abstraction has 425 states and 607 transitions. [2025-02-06 19:12:19,553 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:12:19,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 607 transitions. [2025-02-06 19:12:19,555 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 278 [2025-02-06 19:12:19,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:19,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:19,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:19,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:19,556 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:19,556 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:19,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 2 times [2025-02-06 19:12:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284423825] [2025-02-06 19:12:19,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:19,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:19,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:19,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:19,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:19,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:19,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:19,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:19,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1124764788, now seen corresponding path program 1 times [2025-02-06 19:12:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:19,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572741383] [2025-02-06 19:12:19,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:19,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:12:19,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:12:19,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:19,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:19,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:19,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:12:19,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:12:19,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:19,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash -83124224, now seen corresponding path program 1 times [2025-02-06 19:12:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135606780] [2025-02-06 19:12:19,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:19,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:12:19,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:12:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:19,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135606780] [2025-02-06 19:12:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135606780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:19,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351569541] [2025-02-06 19:12:19,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:19,822 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:19,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-02-06 19:12:19,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:12:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:12:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:19,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 19:12:19,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:20,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351569541] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:20,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-02-06 19:12:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068563759] [2025-02-06 19:12:20,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:20,482 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:20,482 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:20,482 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:20,482 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:20,482 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:12:20,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:20,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:20,483 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:20,483 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2025-02-06 19:12:20,483 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:20,483 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:20,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,776 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:20,777 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:12:20,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:20,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:20,781 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:20,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-06 19:12:20,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:20,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:20,867 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:12:20,867 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0#1=1, ULTIMATE.start_mp_add_~b0~0#1=0, ULTIMATE.start_mp_add_~a0~0#1=255, ULTIMATE.start_mp_add_~r0~0#1=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0#1=1, ULTIMATE.start_mp_add_~b0~0#1=0, ULTIMATE.start_mp_add_~a0~0#1=255, ULTIMATE.start_mp_add_~r0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:12:20,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:20,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:20,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:20,874 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:20,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-06 19:12:20,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:20,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:20,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-06 19:12:20,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:20,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:20,895 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:20,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-06 19:12:20,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:12:20,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:20,968 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:12:20,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:20,973 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:20,973 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:20,973 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:20,973 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:20,973 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:20,973 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:20,973 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:20,973 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:20,973 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2025-02-06 19:12:20,973 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:20,973 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:20,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:20,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:21,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:21,257 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:21,257 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,261 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-06 19:12:21,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-02-06 19:12:21,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:21,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:21,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-06 19:12:21,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,296 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-06 19:12:21,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:21,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:21,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,325 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-06 19:12:21,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:21,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:21,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,357 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-06 19:12:21,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:21,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:21,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-06 19:12:21,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,386 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-06 19:12:21,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:21,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:21,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-02-06 19:12:21,406 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-02-06 19:12:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,408 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-06 19:12:21,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,420 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,423 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-06 19:12:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,436 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-06 19:12:21,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,447 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,448 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-06 19:12:21,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,459 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-06 19:12:21,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,471 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,472 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-02-06 19:12:21,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,485 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-06 19:12:21,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,500 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,501 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,511 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-06 19:12:21,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,524 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,524 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,532 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-02-06 19:12:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,534 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-06 19:12:21,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,546 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:21,550 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:21,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,564 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-02-06 19:12:21,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-02-06 19:12:21,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,576 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:21,577 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:21,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-02-06 19:12:21,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,588 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-02-06 19:12:21,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,599 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:21,600 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:21,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,610 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-02-06 19:12:21,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,622 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:21,623 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:21,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,633 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-02-06 19:12:21,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-02-06 19:12:21,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,645 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:21,646 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:21,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-02-06 19:12:21,655 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-02-06 19:12:21,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,657 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-02-06 19:12:21,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,670 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:21,675 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:21,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-02-06 19:12:21,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,690 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-02-06 19:12:21,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,704 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:21,706 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:21,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,716 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-02-06 19:12:21,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-02-06 19:12:21,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,728 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:21,729 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:21,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-02-06 19:12:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,740 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-06 19:12:21,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,752 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:21,753 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:21,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:12:21,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,763 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-06 19:12:21,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:21,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,775 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:21,776 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:21,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,783 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-02-06 19:12:21,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,785 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-06 19:12:21,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,797 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:21,797 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:21,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,797 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,801 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-02-06 19:12:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,822 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-02-06 19:12:21,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,838 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:21,838 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:21,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,839 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,840 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,857 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-02-06 19:12:21,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,873 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:21,873 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:21,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,873 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,874 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,888 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-06 19:12:21,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,903 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:21,904 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:21,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,904 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,905 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-02-06 19:12:21,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,921 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-02-06 19:12:21,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,936 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:21,936 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:21,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,936 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:21,937 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:12:21,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:21,947 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-02-06 19:12:21,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,949 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-02-06 19:12:21,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:21,965 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:21,965 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:21,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:21,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:21,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:21,965 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:21,971 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:21,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:21,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:21,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-02-06 19:12:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:21,994 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:21,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-02-06 19:12:21,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,010 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,011 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:22,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,011 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,012 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,029 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-02-06 19:12:22,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,045 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,046 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:22,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,046 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,047 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-02-06 19:12:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,063 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-02-06 19:12:22,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,080 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,080 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:22,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,080 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,081 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,098 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-02-06 19:12:22,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,114 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,114 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:22,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,115 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,116 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,130 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-02-06 19:12:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,133 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-02-06 19:12:22,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,145 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,145 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,146 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:22,154 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:22,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-06 19:12:22,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,189 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-02-06 19:12:22,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,207 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,207 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,208 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:22,210 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:22,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,229 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-02-06 19:12:22,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,246 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,246 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,247 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:22,248 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:22,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-02-06 19:12:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,269 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-02-06 19:12:22,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,285 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,285 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,285 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:22,287 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:22,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-02-06 19:12:22,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,305 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-02-06 19:12:22,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,321 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,322 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,322 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:22,323 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:12:22,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,336 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-02-06 19:12:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,339 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-02-06 19:12:22,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,354 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,354 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:22,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,355 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,365 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,385 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-02-06 19:12:22,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,400 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,400 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:22,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,401 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,403 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,418 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-02-06 19:12:22,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,434 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,434 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:22,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,434 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,436 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,452 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-02-06 19:12:22,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,469 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,469 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:22,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,469 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,471 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,486 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-02-06 19:12:22,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,502 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,502 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:22,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,502 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:22,503 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:22,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,515 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-02-06 19:12:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,517 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-02-06 19:12:22,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,534 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,534 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,534 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:22,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:22,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:22,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,568 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-02-06 19:12:22,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,583 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,584 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,584 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:22,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:22,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-02-06 19:12:22,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,624 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-02-06 19:12:22,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,636 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,636 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,637 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:22,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:22,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-02-06 19:12:22,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,650 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-02-06 19:12:22,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,662 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,662 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,662 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:22,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:22,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-02-06 19:12:22,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:22,675 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:22,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-02-06 19:12:22,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:22,687 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:22,687 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:22,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:22,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:22,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:22,687 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:22,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:22,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:22,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:22,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-02-06 19:12:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:22,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 19:12:22,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-02-06 19:12:22,699 INFO L87 Difference]: Start difference. First operand 425 states and 607 transitions. cyclomatic complexity: 191 Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:24,451 INFO L93 Difference]: Finished difference Result 921 states and 1235 transitions. [2025-02-06 19:12:24,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 921 states and 1235 transitions. [2025-02-06 19:12:24,457 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 706 [2025-02-06 19:12:24,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 921 states to 913 states and 1227 transitions. [2025-02-06 19:12:24,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 913 [2025-02-06 19:12:24,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 913 [2025-02-06 19:12:24,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 913 states and 1227 transitions. [2025-02-06 19:12:24,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:24,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 913 states and 1227 transitions. [2025-02-06 19:12:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states and 1227 transitions. [2025-02-06 19:12:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 816. [2025-02-06 19:12:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 816 states have (on average 1.3688725490196079) internal successors, (1117), 815 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1117 transitions. [2025-02-06 19:12:24,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 816 states and 1117 transitions. [2025-02-06 19:12:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 19:12:24,481 INFO L432 stractBuchiCegarLoop]: Abstraction has 816 states and 1117 transitions. [2025-02-06 19:12:24,482 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:12:24,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 816 states and 1117 transitions. [2025-02-06 19:12:24,487 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 645 [2025-02-06 19:12:24,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:24,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:24,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:24,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:24,489 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:24,490 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 3 times [2025-02-06 19:12:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211424931] [2025-02-06 19:12:24,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:12:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:24,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:24,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:24,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:12:24,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:24,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:24,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:24,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:24,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:24,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:24,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:24,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2146628963, now seen corresponding path program 1 times [2025-02-06 19:12:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518724640] [2025-02-06 19:12:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:24,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:24,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:24,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:24,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 19:12:24,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:24,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518724640] [2025-02-06 19:12:24,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518724640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:24,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:24,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406448165] [2025-02-06 19:12:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:24,567 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:24,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:24,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:24,568 INFO L87 Difference]: Start difference. First operand 816 states and 1117 transitions. cyclomatic complexity: 315 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:24,649 INFO L93 Difference]: Finished difference Result 984 states and 1357 transitions. [2025-02-06 19:12:24,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1357 transitions. [2025-02-06 19:12:24,655 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 811 [2025-02-06 19:12:24,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 984 states and 1357 transitions. [2025-02-06 19:12:24,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 984 [2025-02-06 19:12:24,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 984 [2025-02-06 19:12:24,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 984 states and 1357 transitions. [2025-02-06 19:12:24,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:24,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 984 states and 1357 transitions. [2025-02-06 19:12:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states and 1357 transitions. [2025-02-06 19:12:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 870. [2025-02-06 19:12:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 870 states have (on average 1.3862068965517242) internal successors, (1206), 869 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1206 transitions. [2025-02-06 19:12:24,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 870 states and 1206 transitions. [2025-02-06 19:12:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:24,682 INFO L432 stractBuchiCegarLoop]: Abstraction has 870 states and 1206 transitions. [2025-02-06 19:12:24,682 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:12:24,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 870 states and 1206 transitions. [2025-02-06 19:12:24,686 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 699 [2025-02-06 19:12:24,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:24,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:24,687 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:24,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:24,687 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:24,687 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:24,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 4 times [2025-02-06 19:12:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296221098] [2025-02-06 19:12:24,688 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:24,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:12:24,699 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:24,699 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:24,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:24,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:24,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:24,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:24,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash 347383517, now seen corresponding path program 1 times [2025-02-06 19:12:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175551493] [2025-02-06 19:12:24,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:24,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:24,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:24,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 19:12:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175551493] [2025-02-06 19:12:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175551493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411227909] [2025-02-06 19:12:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:24,787 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:24,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:24,787 INFO L87 Difference]: Start difference. First operand 870 states and 1206 transitions. cyclomatic complexity: 350 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:24,863 INFO L93 Difference]: Finished difference Result 1015 states and 1392 transitions. [2025-02-06 19:12:24,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1392 transitions. [2025-02-06 19:12:24,869 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 842 [2025-02-06 19:12:24,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1392 transitions. [2025-02-06 19:12:24,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1015 [2025-02-06 19:12:24,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1015 [2025-02-06 19:12:24,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1392 transitions. [2025-02-06 19:12:24,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:24,876 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1392 transitions. [2025-02-06 19:12:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1392 transitions. [2025-02-06 19:12:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 940. [2025-02-06 19:12:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 940 states have (on average 1.3957446808510638) internal successors, (1312), 939 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1312 transitions. [2025-02-06 19:12:24,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 940 states and 1312 transitions. [2025-02-06 19:12:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:24,895 INFO L432 stractBuchiCegarLoop]: Abstraction has 940 states and 1312 transitions. [2025-02-06 19:12:24,895 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:12:24,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 940 states and 1312 transitions. [2025-02-06 19:12:24,899 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 769 [2025-02-06 19:12:24,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:24,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:24,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:24,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:24,900 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:24,900 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:24,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 5 times [2025-02-06 19:12:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079084757] [2025-02-06 19:12:24,901 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:24,904 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:24,911 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:24,911 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:24,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:24,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:24,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:24,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:24,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:24,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:24,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1642779708, now seen corresponding path program 1 times [2025-02-06 19:12:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120950050] [2025-02-06 19:12:24,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:24,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:24,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:24,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 19:12:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120950050] [2025-02-06 19:12:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120950050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:25,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:25,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:25,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702229670] [2025-02-06 19:12:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:25,001 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:25,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:12:25,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:12:25,002 INFO L87 Difference]: Start difference. First operand 940 states and 1312 transitions. cyclomatic complexity: 386 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:25,060 INFO L93 Difference]: Finished difference Result 1697 states and 2362 transitions. [2025-02-06 19:12:25,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1697 states and 2362 transitions. [2025-02-06 19:12:25,070 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1526 [2025-02-06 19:12:25,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1697 states to 1697 states and 2362 transitions. [2025-02-06 19:12:25,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1697 [2025-02-06 19:12:25,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1697 [2025-02-06 19:12:25,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1697 states and 2362 transitions. [2025-02-06 19:12:25,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:25,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1697 states and 2362 transitions. [2025-02-06 19:12:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states and 2362 transitions. [2025-02-06 19:12:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1457. [2025-02-06 19:12:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1457 states have (on average 1.3912148249828415) internal successors, (2027), 1456 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2027 transitions. [2025-02-06 19:12:25,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1457 states and 2027 transitions. [2025-02-06 19:12:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:12:25,113 INFO L432 stractBuchiCegarLoop]: Abstraction has 1457 states and 2027 transitions. [2025-02-06 19:12:25,113 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:12:25,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1457 states and 2027 transitions. [2025-02-06 19:12:25,119 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1286 [2025-02-06 19:12:25,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:25,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:25,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:25,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:25,120 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:25,121 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:25,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 6 times [2025-02-06 19:12:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871929097] [2025-02-06 19:12:25,122 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:12:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:25,126 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:25,136 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:25,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:12:25,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:25,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:25,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:25,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:25,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:25,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -666201828, now seen corresponding path program 1 times [2025-02-06 19:12:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056990411] [2025-02-06 19:12:25,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:25,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:25,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 19:12:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056990411] [2025-02-06 19:12:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056990411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607796310] [2025-02-06 19:12:25,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:25,268 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:25,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-02-06 19:12:25,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:25,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:25,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:25,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:12:25,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 19:12:25,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 19:12:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607796310] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:25,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 19:12:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790674446] [2025-02-06 19:12:25,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:25,404 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:25,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:12:25,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:12:25,407 INFO L87 Difference]: Start difference. First operand 1457 states and 2027 transitions. cyclomatic complexity: 584 Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:25,586 INFO L93 Difference]: Finished difference Result 1576 states and 2143 transitions. [2025-02-06 19:12:25,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1576 states and 2143 transitions. [2025-02-06 19:12:25,595 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1359 [2025-02-06 19:12:25,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1576 states to 1566 states and 2128 transitions. [2025-02-06 19:12:25,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1566 [2025-02-06 19:12:25,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1566 [2025-02-06 19:12:25,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1566 states and 2128 transitions. [2025-02-06 19:12:25,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:25,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1566 states and 2128 transitions. [2025-02-06 19:12:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states and 2128 transitions. [2025-02-06 19:12:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1353. [2025-02-06 19:12:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1353 states have (on average 1.3784183296378418) internal successors, (1865), 1352 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1865 transitions. [2025-02-06 19:12:25,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1353 states and 1865 transitions. [2025-02-06 19:12:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:12:25,630 INFO L432 stractBuchiCegarLoop]: Abstraction has 1353 states and 1865 transitions. [2025-02-06 19:12:25,630 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:12:25,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1353 states and 1865 transitions. [2025-02-06 19:12:25,635 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1172 [2025-02-06 19:12:25,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:25,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:25,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:25,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:25,636 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:25,637 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:25,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 7 times [2025-02-06 19:12:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721481970] [2025-02-06 19:12:25,638 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:12:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:25,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:25,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:25,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:25,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:25,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:25,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:25,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:25,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1268444801, now seen corresponding path program 1 times [2025-02-06 19:12:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:25,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910497153] [2025-02-06 19:12:25,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:25,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:12:25,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:12:25,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 19:12:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:25,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910497153] [2025-02-06 19:12:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910497153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:25,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:25,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:25,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204138387] [2025-02-06 19:12:25,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:25,688 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:25,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:25,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:25,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:25,689 INFO L87 Difference]: Start difference. First operand 1353 states and 1865 transitions. cyclomatic complexity: 526 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:25,761 INFO L93 Difference]: Finished difference Result 1474 states and 1952 transitions. [2025-02-06 19:12:25,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 1952 transitions. [2025-02-06 19:12:25,768 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1288 [2025-02-06 19:12:25,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 1952 transitions. [2025-02-06 19:12:25,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2025-02-06 19:12:25,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2025-02-06 19:12:25,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 1952 transitions. [2025-02-06 19:12:25,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:25,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 1952 transitions. [2025-02-06 19:12:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 1952 transitions. [2025-02-06 19:12:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1375. [2025-02-06 19:12:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1375 states have (on average 1.3476363636363637) internal successors, (1853), 1374 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1853 transitions. [2025-02-06 19:12:25,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1375 states and 1853 transitions. [2025-02-06 19:12:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:25,834 INFO L432 stractBuchiCegarLoop]: Abstraction has 1375 states and 1853 transitions. [2025-02-06 19:12:25,834 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:12:25,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1375 states and 1853 transitions. [2025-02-06 19:12:25,840 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1194 [2025-02-06 19:12:25,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:25,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:25,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:25,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:25,841 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:25,841 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:25,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 8 times [2025-02-06 19:12:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:25,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171881931] [2025-02-06 19:12:25,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:25,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:25,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:25,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:25,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:25,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:25,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:25,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:25,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:25,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:25,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash -196540638, now seen corresponding path program 1 times [2025-02-06 19:12:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:25,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647226045] [2025-02-06 19:12:25,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:25,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:12:25,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:12:25,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:25,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 19:12:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647226045] [2025-02-06 19:12:25,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647226045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261820538] [2025-02-06 19:12:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:25,893 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:25,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:25,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:25,894 INFO L87 Difference]: Start difference. First operand 1375 states and 1853 transitions. cyclomatic complexity: 492 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:25,962 INFO L93 Difference]: Finished difference Result 1424 states and 1835 transitions. [2025-02-06 19:12:25,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1424 states and 1835 transitions. [2025-02-06 19:12:25,968 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1241 [2025-02-06 19:12:25,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1424 states to 1424 states and 1835 transitions. [2025-02-06 19:12:25,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1424 [2025-02-06 19:12:25,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1424 [2025-02-06 19:12:25,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1424 states and 1835 transitions. [2025-02-06 19:12:25,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:25,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1424 states and 1835 transitions. [2025-02-06 19:12:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states and 1835 transitions. [2025-02-06 19:12:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1342. [2025-02-06 19:12:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1342 states have (on average 1.3040238450074515) internal successors, (1750), 1341 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1750 transitions. [2025-02-06 19:12:26,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1342 states and 1750 transitions. [2025-02-06 19:12:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:26,003 INFO L432 stractBuchiCegarLoop]: Abstraction has 1342 states and 1750 transitions. [2025-02-06 19:12:26,003 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:12:26,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1342 states and 1750 transitions. [2025-02-06 19:12:26,007 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1161 [2025-02-06 19:12:26,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:26,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:26,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:26,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:26,008 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:26,008 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 9 times [2025-02-06 19:12:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744962753] [2025-02-06 19:12:26,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:12:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:26,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:26,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:26,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:12:26,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:26,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:26,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:26,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 744665633, now seen corresponding path program 1 times [2025-02-06 19:12:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:26,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531496591] [2025-02-06 19:12:26,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:26,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:12:26,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:12:26,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:26,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:26,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531496591] [2025-02-06 19:12:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531496591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402474887] [2025-02-06 19:12:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,185 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-02-06 19:12:26,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:12:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:12:26,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:26,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:12:26,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 19:12:26,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 19:12:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402474887] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:26,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2025-02-06 19:12:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686720917] [2025-02-06 19:12:26,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:26,421 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:26,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:26,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 19:12:26,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 19:12:26,422 INFO L87 Difference]: Start difference. First operand 1342 states and 1750 transitions. cyclomatic complexity: 422 Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:28,245 INFO L93 Difference]: Finished difference Result 2636 states and 3195 transitions. [2025-02-06 19:12:28,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2636 states and 3195 transitions. [2025-02-06 19:12:28,252 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2331 [2025-02-06 19:12:28,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2636 states to 2579 states and 3135 transitions. [2025-02-06 19:12:28,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2579 [2025-02-06 19:12:28,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2579 [2025-02-06 19:12:28,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2579 states and 3135 transitions. [2025-02-06 19:12:28,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:28,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2579 states and 3135 transitions. [2025-02-06 19:12:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states and 3135 transitions. [2025-02-06 19:12:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 1873. [2025-02-06 19:12:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1873 states have (on average 1.2658836091831287) internal successors, (2371), 1872 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2371 transitions. [2025-02-06 19:12:28,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1873 states and 2371 transitions. [2025-02-06 19:12:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 19:12:28,304 INFO L432 stractBuchiCegarLoop]: Abstraction has 1873 states and 2371 transitions. [2025-02-06 19:12:28,304 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:12:28,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1873 states and 2371 transitions. [2025-02-06 19:12:28,308 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1670 [2025-02-06 19:12:28,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:28,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:28,309 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:28,309 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:28,309 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:28,310 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 10 times [2025-02-06 19:12:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439841392] [2025-02-06 19:12:28,311 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:28,314 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:12:28,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:28,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:28,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:28,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:28,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:28,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:28,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:28,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:28,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:28,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2024322427, now seen corresponding path program 1 times [2025-02-06 19:12:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710187394] [2025-02-06 19:12:28,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:28,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:12:28,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:12:28,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:28,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 19:12:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:28,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710187394] [2025-02-06 19:12:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710187394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 19:12:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899580091] [2025-02-06 19:12:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:28,465 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:28,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:12:28,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:12:28,465 INFO L87 Difference]: Start difference. First operand 1873 states and 2371 transitions. cyclomatic complexity: 512 Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:28,695 INFO L93 Difference]: Finished difference Result 2961 states and 3650 transitions. [2025-02-06 19:12:28,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2961 states and 3650 transitions. [2025-02-06 19:12:28,701 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 2446 [2025-02-06 19:12:28,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2961 states to 2863 states and 3537 transitions. [2025-02-06 19:12:28,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2863 [2025-02-06 19:12:28,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2863 [2025-02-06 19:12:28,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2863 states and 3537 transitions. [2025-02-06 19:12:28,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:28,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2863 states and 3537 transitions. [2025-02-06 19:12:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states and 3537 transitions. [2025-02-06 19:12:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2280. [2025-02-06 19:12:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2280 states have (on average 1.2714912280701753) internal successors, (2899), 2279 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 2899 transitions. [2025-02-06 19:12:28,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2280 states and 2899 transitions. [2025-02-06 19:12:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:12:28,761 INFO L432 stractBuchiCegarLoop]: Abstraction has 2280 states and 2899 transitions. [2025-02-06 19:12:28,761 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:12:28,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2280 states and 2899 transitions. [2025-02-06 19:12:28,766 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 2036 [2025-02-06 19:12:28,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:28,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:28,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:28,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:28,767 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:28,767 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:28,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 11 times [2025-02-06 19:12:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160397061] [2025-02-06 19:12:28,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:28,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:28,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:28,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:28,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:28,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:28,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:28,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:28,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:28,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1424235479, now seen corresponding path program 1 times [2025-02-06 19:12:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141663727] [2025-02-06 19:12:28,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:12:28,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:12:28,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:28,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 88 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 19:12:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141663727] [2025-02-06 19:12:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141663727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320624164] [2025-02-06 19:12:28,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:28,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:28,992 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:28,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-02-06 19:12:29,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:12:29,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:12:29,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:29,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:29,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:12:29,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 88 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 19:12:29,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 88 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 19:12:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320624164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:29,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 19:12:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74615503] [2025-02-06 19:12:29,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:29,180 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:29,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:12:29,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:12:29,181 INFO L87 Difference]: Start difference. First operand 2280 states and 2899 transitions. cyclomatic complexity: 638 Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:29,290 INFO L93 Difference]: Finished difference Result 2985 states and 3674 transitions. [2025-02-06 19:12:29,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2985 states and 3674 transitions. [2025-02-06 19:12:29,302 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 2184 [2025-02-06 19:12:29,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2985 states to 2985 states and 3674 transitions. [2025-02-06 19:12:29,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2985 [2025-02-06 19:12:29,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2985 [2025-02-06 19:12:29,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2985 states and 3674 transitions. [2025-02-06 19:12:29,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:29,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2985 states and 3674 transitions. [2025-02-06 19:12:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states and 3674 transitions. [2025-02-06 19:12:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2002. [2025-02-06 19:12:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2002 states have (on average 1.2492507492507492) internal successors, (2501), 2001 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2501 transitions. [2025-02-06 19:12:29,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2002 states and 2501 transitions. [2025-02-06 19:12:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:12:29,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 2002 states and 2501 transitions. [2025-02-06 19:12:29,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-06 19:12:29,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2002 states and 2501 transitions. [2025-02-06 19:12:29,356 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 1618 [2025-02-06 19:12:29,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:29,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:29,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:29,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:29,357 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:29,357 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1925493493, now seen corresponding path program 12 times [2025-02-06 19:12:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813103229] [2025-02-06 19:12:29,358 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:12:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:29,361 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:29,365 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:29,365 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:12:29,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:29,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:29,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:12:29,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:12:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:29,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:29,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:29,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1412919352, now seen corresponding path program 2 times [2025-02-06 19:12:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:29,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24087364] [2025-02-06 19:12:29,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:29,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:29,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-06 19:12:29,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:12:29,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:12:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 12 proven. 95 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 19:12:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24087364] [2025-02-06 19:12:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24087364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292106141] [2025-02-06 19:12:29,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:29,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:29,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:29,655 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:29,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2025-02-06 19:12:29,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-06 19:12:29,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:12:29,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:12:29,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:29,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:12:29,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 83 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 19:12:29,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 55 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 19:12:30,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292106141] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:30,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:30,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2025-02-06 19:12:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917712617] [2025-02-06 19:12:30,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:30,016 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:30,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:30,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 19:12:30,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-02-06 19:12:30,017 INFO L87 Difference]: Start difference. First operand 2002 states and 2501 transitions. cyclomatic complexity: 525 Second operand has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:31,132 INFO L93 Difference]: Finished difference Result 4053 states and 4909 transitions. [2025-02-06 19:12:31,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4053 states and 4909 transitions. [2025-02-06 19:12:31,142 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 2820 [2025-02-06 19:12:31,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4053 states to 3954 states and 4781 transitions. [2025-02-06 19:12:31,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3954 [2025-02-06 19:12:31,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3954 [2025-02-06 19:12:31,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3954 states and 4781 transitions. [2025-02-06 19:12:31,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:31,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3954 states and 4781 transitions. [2025-02-06 19:12:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states and 4781 transitions. [2025-02-06 19:12:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 2059. [2025-02-06 19:12:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 2059 states have (on average 1.2224380767362797) internal successors, (2517), 2058 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2517 transitions. [2025-02-06 19:12:31,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2059 states and 2517 transitions. [2025-02-06 19:12:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 19:12:31,199 INFO L432 stractBuchiCegarLoop]: Abstraction has 2059 states and 2517 transitions. [2025-02-06 19:12:31,199 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-06 19:12:31,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2059 states and 2517 transitions. [2025-02-06 19:12:31,202 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 1458 [2025-02-06 19:12:31,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:31,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:31,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:31,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:31,203 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:31,203 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2086089299, now seen corresponding path program 1 times [2025-02-06 19:12:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713045242] [2025-02-06 19:12:31,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:31,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:12:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:12:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:31,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:31,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:12:31,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:12:31,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:31,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:31,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1629741891, now seen corresponding path program 1 times [2025-02-06 19:12:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:31,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564246836] [2025-02-06 19:12:31,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:31,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:12:31,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:12:31,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 19:12:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564246836] [2025-02-06 19:12:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564246836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:31,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:12:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94919313] [2025-02-06 19:12:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:31,256 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:31,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:31,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:31,256 INFO L87 Difference]: Start difference. First operand 2059 states and 2517 transitions. cyclomatic complexity: 485 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:31,321 INFO L93 Difference]: Finished difference Result 2009 states and 2424 transitions. [2025-02-06 19:12:31,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2009 states and 2424 transitions. [2025-02-06 19:12:31,326 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 1377 [2025-02-06 19:12:31,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2009 states to 2003 states and 2417 transitions. [2025-02-06 19:12:31,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2003 [2025-02-06 19:12:31,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2003 [2025-02-06 19:12:31,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2003 states and 2417 transitions. [2025-02-06 19:12:31,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:31,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2003 states and 2417 transitions. [2025-02-06 19:12:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states and 2417 transitions. [2025-02-06 19:12:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1973. [2025-02-06 19:12:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1973 states have (on average 1.2078053725291433) internal successors, (2383), 1972 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2383 transitions. [2025-02-06 19:12:31,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1973 states and 2383 transitions. [2025-02-06 19:12:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:31,360 INFO L432 stractBuchiCegarLoop]: Abstraction has 1973 states and 2383 transitions. [2025-02-06 19:12:31,360 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-06 19:12:31,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1973 states and 2383 transitions. [2025-02-06 19:12:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 1368 [2025-02-06 19:12:31,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:31,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:31,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:31,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:31,365 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" [2025-02-06 19:12:31,365 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" [2025-02-06 19:12:31,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1038391895, now seen corresponding path program 1 times [2025-02-06 19:12:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:31,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086960942] [2025-02-06 19:12:31,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:31,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:12:31,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:12:31,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:31,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:31,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:12:31,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:12:31,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:31,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1338207427, now seen corresponding path program 1 times [2025-02-06 19:12:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336582295] [2025-02-06 19:12:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:31,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:12:31,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:12:31,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336582295] [2025-02-06 19:12:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336582295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:12:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204378000] [2025-02-06 19:12:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:31,458 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:31,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:12:31,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:12:31,458 INFO L87 Difference]: Start difference. First operand 1973 states and 2383 transitions. cyclomatic complexity: 436 Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:31,620 INFO L93 Difference]: Finished difference Result 2566 states and 3075 transitions. [2025-02-06 19:12:31,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2566 states and 3075 transitions. [2025-02-06 19:12:31,625 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 1739 [2025-02-06 19:12:31,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2566 states to 2566 states and 3075 transitions. [2025-02-06 19:12:31,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2566 [2025-02-06 19:12:31,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2566 [2025-02-06 19:12:31,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2566 states and 3075 transitions. [2025-02-06 19:12:31,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:31,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2566 states and 3075 transitions. [2025-02-06 19:12:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states and 3075 transitions. [2025-02-06 19:12:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1940. [2025-02-06 19:12:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1940 states have (on average 1.2030927835051546) internal successors, (2334), 1939 states have internal predecessors, (2334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2334 transitions. [2025-02-06 19:12:31,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1940 states and 2334 transitions. [2025-02-06 19:12:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:12:31,659 INFO L432 stractBuchiCegarLoop]: Abstraction has 1940 states and 2334 transitions. [2025-02-06 19:12:31,659 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-06 19:12:31,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1940 states and 2334 transitions. [2025-02-06 19:12:31,663 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 1343 [2025-02-06 19:12:31,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:31,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:31,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:31,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:31,664 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" [2025-02-06 19:12:31,664 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" [2025-02-06 19:12:31,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1038391895, now seen corresponding path program 2 times [2025-02-06 19:12:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:31,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463970423] [2025-02-06 19:12:31,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:31,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:12:31,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:12:31,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:31,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:31,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:31,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:12:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:12:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:31,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:31,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1598160386, now seen corresponding path program 1 times [2025-02-06 19:12:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:31,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067446062] [2025-02-06 19:12:31,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:31,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 19:12:31,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 19:12:31,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:31,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067446062] [2025-02-06 19:12:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067446062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611811238] [2025-02-06 19:12:31,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:31,821 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:31,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-02-06 19:12:31,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 19:12:31,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 19:12:31,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:31,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:31,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:12:31,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:31,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:31,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611811238] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:31,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:31,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-02-06 19:12:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618886700] [2025-02-06 19:12:31,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:31,974 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:31,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:12:31,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:12:31,974 INFO L87 Difference]: Start difference. First operand 1940 states and 2334 transitions. cyclomatic complexity: 418 Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:32,285 INFO L93 Difference]: Finished difference Result 1441 states and 1609 transitions. [2025-02-06 19:12:32,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1441 states and 1609 transitions. [2025-02-06 19:12:32,287 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 267 [2025-02-06 19:12:32,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1441 states to 1381 states and 1543 transitions. [2025-02-06 19:12:32,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1381 [2025-02-06 19:12:32,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1381 [2025-02-06 19:12:32,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1381 states and 1543 transitions. [2025-02-06 19:12:32,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:32,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1381 states and 1543 transitions. [2025-02-06 19:12:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states and 1543 transitions. [2025-02-06 19:12:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 965. [2025-02-06 19:12:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 965 states have (on average 1.122279792746114) internal successors, (1083), 964 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1083 transitions. [2025-02-06 19:12:32,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 965 states and 1083 transitions. [2025-02-06 19:12:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:12:32,302 INFO L432 stractBuchiCegarLoop]: Abstraction has 965 states and 1083 transitions. [2025-02-06 19:12:32,302 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-06 19:12:32,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 965 states and 1083 transitions. [2025-02-06 19:12:32,304 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 250 [2025-02-06 19:12:32,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:32,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:32,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:32,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-02-06 19:12:32,305 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume !(0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume !(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := 0;" [2025-02-06 19:12:32,305 INFO L754 eck$LassoCheckResult]: Loop: "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := 0;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := 0;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := 0;" [2025-02-06 19:12:32,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1133903320, now seen corresponding path program 1 times [2025-02-06 19:12:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:32,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456362607] [2025-02-06 19:12:32,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:32,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:12:32,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:12:32,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:12:32,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456362607] [2025-02-06 19:12:32,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456362607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:32,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:32,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257787891] [2025-02-06 19:12:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:32,391 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:32,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -50938545, now seen corresponding path program 1 times [2025-02-06 19:12:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:32,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756137185] [2025-02-06 19:12:32,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:32,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:12:32,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:12:32,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:12:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756137185] [2025-02-06 19:12:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756137185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138166357] [2025-02-06 19:12:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:32,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:32,437 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:32,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-02-06 19:12:32,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:12:32,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:12:32,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:32,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:12:32,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 19:12:32,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:12:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138166357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:32,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:12:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 19:12:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789153679] [2025-02-06 19:12:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:32,494 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:32,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:12:32,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:12:32,495 INFO L87 Difference]: Start difference. First operand 965 states and 1083 transitions. cyclomatic complexity: 127 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:32,598 INFO L93 Difference]: Finished difference Result 1005 states and 1115 transitions. [2025-02-06 19:12:32,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1005 states and 1115 transitions. [2025-02-06 19:12:32,601 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 205 [2025-02-06 19:12:32,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1005 states to 828 states and 895 transitions. [2025-02-06 19:12:32,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 828 [2025-02-06 19:12:32,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 828 [2025-02-06 19:12:32,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 828 states and 895 transitions. [2025-02-06 19:12:32,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:32,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 828 states and 895 transitions. [2025-02-06 19:12:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states and 895 transitions. [2025-02-06 19:12:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 693. [2025-02-06 19:12:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 693 states have (on average 1.0952380952380953) internal successors, (759), 692 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 759 transitions. [2025-02-06 19:12:32,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 693 states and 759 transitions. [2025-02-06 19:12:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:12:32,611 INFO L432 stractBuchiCegarLoop]: Abstraction has 693 states and 759 transitions. [2025-02-06 19:12:32,611 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-06 19:12:32,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 693 states and 759 transitions. [2025-02-06 19:12:32,612 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 203 [2025-02-06 19:12:32,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:32,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:32,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:32,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 19:12:32,613 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume !(0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:32,614 INFO L754 eck$LassoCheckResult]: Loop: "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1566877165, now seen corresponding path program 1 times [2025-02-06 19:12:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417127321] [2025-02-06 19:12:32,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:32,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:32,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:32,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:32,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:12:32,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:12:32,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:32,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:32,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -391916311, now seen corresponding path program 1 times [2025-02-06 19:12:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230662768] [2025-02-06 19:12:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:32,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 19:12:32,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:12:32,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230662768] [2025-02-06 19:12:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230662768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463702939] [2025-02-06 19:12:32,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:32,761 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:32,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-02-06 19:12:32,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 19:12:32,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:12:32,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:32,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:32,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:12:32,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:12:32,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:12:32,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463702939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:32,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:32,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-02-06 19:12:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139495639] [2025-02-06 19:12:32,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:32,928 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:32,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:12:32,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:12:32,928 INFO L87 Difference]: Start difference. First operand 693 states and 759 transitions. cyclomatic complexity: 72 Second operand has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:33,349 INFO L93 Difference]: Finished difference Result 772 states and 838 transitions. [2025-02-06 19:12:33,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 838 transitions. [2025-02-06 19:12:33,351 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 215 [2025-02-06 19:12:33,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 724 states and 780 transitions. [2025-02-06 19:12:33,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 724 [2025-02-06 19:12:33,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 724 [2025-02-06 19:12:33,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 724 states and 780 transitions. [2025-02-06 19:12:33,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:33,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 724 states and 780 transitions. [2025-02-06 19:12:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states and 780 transitions. [2025-02-06 19:12:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 425. [2025-02-06 19:12:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 425 states have (on average 1.0894117647058823) internal successors, (463), 424 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 463 transitions. [2025-02-06 19:12:33,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 425 states and 463 transitions. [2025-02-06 19:12:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:12:33,360 INFO L432 stractBuchiCegarLoop]: Abstraction has 425 states and 463 transitions. [2025-02-06 19:12:33,360 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-06 19:12:33,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 463 transitions. [2025-02-06 19:12:33,360 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2025-02-06 19:12:33,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:33,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:33,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:33,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2025-02-06 19:12:33,361 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" [2025-02-06 19:12:33,362 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" [2025-02-06 19:12:33,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1125600771, now seen corresponding path program 1 times [2025-02-06 19:12:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142154850] [2025-02-06 19:12:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:33,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 19:12:33,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:12:33,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142154850] [2025-02-06 19:12:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142154850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517971016] [2025-02-06 19:12:33,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:33,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:33,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:33,524 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:33,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-02-06 19:12:33,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 19:12:33,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:12:33,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:33,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:33,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:12:33,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 19:12:33,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:12:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517971016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:12:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-02-06 19:12:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910172836] [2025-02-06 19:12:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:33,710 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1665205085, now seen corresponding path program 1 times [2025-02-06 19:12:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411372536] [2025-02-06 19:12:33,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:33,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:33,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 19:12:33,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:12:33,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:33,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411372536] [2025-02-06 19:12:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411372536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206658341] [2025-02-06 19:12:33,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:33,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:33,812 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:33,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-02-06 19:12:33,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 19:12:33,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:12:33,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:33,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:33,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:12:33,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 19:12:33,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 19:12:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206658341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:33,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 11 [2025-02-06 19:12:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641755056] [2025-02-06 19:12:33,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:33,975 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:12:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:12:33,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:12:33,975 INFO L87 Difference]: Start difference. First operand 425 states and 463 transitions. cyclomatic complexity: 41 Second operand has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:34,399 INFO L93 Difference]: Finished difference Result 434 states and 470 transitions. [2025-02-06 19:12:34,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 470 transitions. [2025-02-06 19:12:34,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2025-02-06 19:12:34,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 470 transitions. [2025-02-06 19:12:34,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2025-02-06 19:12:34,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2025-02-06 19:12:34,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 470 transitions. [2025-02-06 19:12:34,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:34,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 470 transitions. [2025-02-06 19:12:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 470 transitions. [2025-02-06 19:12:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 365. [2025-02-06 19:12:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 365 states have (on average 1.0876712328767124) internal successors, (397), 364 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 397 transitions. [2025-02-06 19:12:34,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 365 states and 397 transitions. [2025-02-06 19:12:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:12:34,406 INFO L432 stractBuchiCegarLoop]: Abstraction has 365 states and 397 transitions. [2025-02-06 19:12:34,406 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-06 19:12:34,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 397 transitions. [2025-02-06 19:12:34,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-02-06 19:12:34,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:34,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:34,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:34,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:34,409 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" [2025-02-06 19:12:34,410 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" [2025-02-06 19:12:34,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1235993221, now seen corresponding path program 1 times [2025-02-06 19:12:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:34,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550410286] [2025-02-06 19:12:34,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:34,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 19:12:34,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:34,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:34,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 36 proven. 31 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-06 19:12:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:34,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550410286] [2025-02-06 19:12:34,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550410286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:34,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364413066] [2025-02-06 19:12:34,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:34,783 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:34,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-02-06 19:12:34,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 19:12:34,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:34,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:34,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:34,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 19:12:34,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 74 proven. 29 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-06 19:12:35,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 78 proven. 49 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 19:12:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364413066] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:35,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2025-02-06 19:12:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020313483] [2025-02-06 19:12:35,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:35,820 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:35,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2039586589, now seen corresponding path program 1 times [2025-02-06 19:12:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998366081] [2025-02-06 19:12:35,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:35,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:35,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:35,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:35,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:35,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:35,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:35,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:35,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:35,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:35,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:35,943 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:35,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:35,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:35,943 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:35,943 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:12:35,943 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:35,943 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:35,943 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:35,943 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration24_Loop [2025-02-06 19:12:35,943 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:35,943 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:35,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:36,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:36,481 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:12:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:36,483 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:36,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-02-06 19:12:36,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:36,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:36,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-02-06 19:12:36,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:36,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:36,778 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:36,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-02-06 19:12:36,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:12:36,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:36,895 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:12:36,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:36,900 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:36,900 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:36,900 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:36,900 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:36,900 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:36,900 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:36,900 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:36,900 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:36,900 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration24_Loop [2025-02-06 19:12:36,900 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:36,900 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:36,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:37,427 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:37,427 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:37,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,431 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-02-06 19:12:37,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:37,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,442 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:37,448 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:37,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-02-06 19:12:37,460 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-02-06 19:12:37,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,462 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-02-06 19:12:37,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:37,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,474 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,474 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:37,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:37,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-02-06 19:12:37,502 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-02-06 19:12:37,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,503 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-02-06 19:12:37,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:37,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,516 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,516 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:37,526 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:12:37,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-02-06 19:12:37,544 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-02-06 19:12:37,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,546 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-02-06 19:12:37,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:37,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,559 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,559 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:37,573 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:12:37,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-02-06 19:12:37,596 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-02-06 19:12:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,598 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-02-06 19:12:37,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,610 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:37,610 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:37,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,610 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,610 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:37,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:37,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-02-06 19:12:37,643 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-02-06 19:12:37,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,645 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-02-06 19:12:37,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,657 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:37,657 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:37,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,657 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,657 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:37,668 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:12:37,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-02-06 19:12:37,699 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-02-06 19:12:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,701 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-02-06 19:12:37,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,714 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:37,714 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:37,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,714 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,714 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:37,729 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:12:37,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-02-06 19:12:37,780 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-02-06 19:12:37,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,783 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-02-06 19:12:37,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,797 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:37,797 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:37,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,797 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,797 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:37,813 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:12:37,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-02-06 19:12:37,837 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-02-06 19:12:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:37,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:37,839 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:37,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-02-06 19:12:37,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:37,854 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:37,854 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:37,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:37,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:37,854 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:37,854 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:37,872 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:12:37,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:37,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:37,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-02-06 19:12:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:37,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 19:12:37,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-02-06 19:12:37,906 INFO L87 Difference]: Start difference. First operand 365 states and 397 transitions. cyclomatic complexity: 34 Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:38,860 INFO L93 Difference]: Finished difference Result 883 states and 934 transitions. [2025-02-06 19:12:38,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 934 transitions. [2025-02-06 19:12:38,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-02-06 19:12:38,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 318 states and 336 transitions. [2025-02-06 19:12:38,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2025-02-06 19:12:38,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2025-02-06 19:12:38,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 336 transitions. [2025-02-06 19:12:38,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:38,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 318 states and 336 transitions. [2025-02-06 19:12:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 336 transitions. [2025-02-06 19:12:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 286. [2025-02-06 19:12:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 286 states have (on average 1.062937062937063) internal successors, (304), 285 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 304 transitions. [2025-02-06 19:12:38,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 286 states and 304 transitions. [2025-02-06 19:12:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 19:12:38,866 INFO L432 stractBuchiCegarLoop]: Abstraction has 286 states and 304 transitions. [2025-02-06 19:12:38,866 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-02-06 19:12:38,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 304 transitions. [2025-02-06 19:12:38,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-02-06 19:12:38,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:38,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:38,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:38,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:38,867 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(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4;" "assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1;" "mp_add_~nb~0#1 := 4;" "assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume 0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1;" "assume !(0 == (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296);" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1;" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1;" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1;" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1;" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1;" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" [2025-02-06 19:12:38,868 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 255);" "assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296));" "mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0;" [2025-02-06 19:12:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -907709067, now seen corresponding path program 1 times [2025-02-06 19:12:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504853658] [2025-02-06 19:12:38,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 19:12:38,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 19:12:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-02-06 19:12:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504853658] [2025-02-06 19:12:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504853658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:12:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416584038] [2025-02-06 19:12:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:39,019 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2039586589, now seen corresponding path program 2 times [2025-02-06 19:12:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198553016] [2025-02-06 19:12:39,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:39,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:39,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:39,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:39,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:39,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:39,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:12:39,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:39,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:39,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:39,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:39,135 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:39,135 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:39,135 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:39,135 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:39,135 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:12:39,135 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:39,135 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:39,135 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:39,135 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration25_Loop [2025-02-06 19:12:39,135 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:39,135 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:39,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:39,604 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:39,604 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:12:39,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:39,606 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:39,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-02-06 19:12:39,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:12:39,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:39,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-02-06 19:12:39,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:39,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:39,839 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:39,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-02-06 19:12:39,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:12:39,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:12:39,915 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:12:39,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-02-06 19:12:39,919 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:39,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:39,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:39,919 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:39,920 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:39,920 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:39,920 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:39,920 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:39,920 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration25_Loop [2025-02-06 19:12:39,920 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:39,920 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:39,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:40,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:40,428 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:40,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,432 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-02-06 19:12:40,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:40,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,447 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:40,451 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:12:40,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:40,463 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-02-06 19:12:40,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,465 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-02-06 19:12:40,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:40,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,477 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,477 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:40,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:40,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-02-06 19:12:40,501 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-02-06 19:12:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,504 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-02-06 19:12:40,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:40,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,516 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,516 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:40,526 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:12:40,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:40,543 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-02-06 19:12:40,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,545 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-02-06 19:12:40,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:40,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,559 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,559 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:40,571 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:12:40,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:40,591 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-02-06 19:12:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,593 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-02-06 19:12:40,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,606 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:40,606 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:40,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,606 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,606 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:12:40,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:40,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-02-06 19:12:40,635 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-02-06 19:12:40,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,637 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-02-06 19:12:40,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,649 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:40,649 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:12:40,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,649 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,649 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:40,660 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:12:40,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-02-06 19:12:40,692 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-02-06 19:12:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,694 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-02-06 19:12:40,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,707 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:40,707 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:40,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,707 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,707 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:12:40,723 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:12:40,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-02-06 19:12:40,773 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-02-06 19:12:40,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,775 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-02-06 19:12:40,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,787 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:40,787 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:12:40,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,787 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,787 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:12:40,797 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:12:40,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-02-06 19:12:40,839 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-02-06 19:12:40,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:40,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:40,841 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:40,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-02-06 19:12:40,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:40,853 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:12:40,854 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:12:40,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:40,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:40,854 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:12:40,854 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:12:40,870 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:12:40,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:40,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:40,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-02-06 19:12:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:40,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:40,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:40,906 INFO L87 Difference]: Start difference. First operand 286 states and 304 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:40,906 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2025-02-06 19:12:40,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 12 transitions. [2025-02-06 19:12:40,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:12:40,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2025-02-06 19:12:40,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:12:40,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:12:40,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:12:40,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:40,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:12:40,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:12:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:40,907 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:12:40,907 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-02-06 19:12:40,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:12:40,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:12:40,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:12:40,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:12:40 BoogieIcfgContainer [2025-02-06 19:12:40,914 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:12:40,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:12:40,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:12:40,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:12:40,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:12:12" (3/4) ... [2025-02-06 19:12:40,917 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:12:40,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:12:40,919 INFO L158 Benchmark]: Toolchain (without parser) took 29780.58ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 122.7MB in the beginning and 459.2MB in the end (delta: -336.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2025-02-06 19:12:40,919 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:40,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.76ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:12:40,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.23ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 107.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:12:40,920 INFO L158 Benchmark]: Boogie Preprocessor took 45.59ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 105.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:40,920 INFO L158 Benchmark]: IcfgBuilder took 597.71ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 81.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 19:12:40,920 INFO L158 Benchmark]: BuchiAutomizer took 28830.87ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 81.9MB in the beginning and 459.4MB in the end (delta: -377.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:40,920 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 520.1MB. Free memory was 459.4MB in the beginning and 459.2MB in the end (delta: 161.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:40,922 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.76ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.23ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 107.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.59ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 105.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 597.71ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 81.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 28830.87ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 81.9MB in the beginning and 459.4MB in the end (delta: -377.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 520.1MB. Free memory was 459.4MB in the beginning and 459.2MB in the end (delta: 161.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (25 trivial, 0 deterministic, 0 nondeterministic). 25 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.7s and 26 iterations. TraceHistogramMax:7. Analysis of lassos took 16.8s. Construction of modules took 6.9s. Büchi inclusion checks took 4.8s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 7083 StatesRemovedByMinimization, 24 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5306 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5306 mSDsluCounter, 4938 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3623 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11678 IncrementalHoareTripleChecker+Invalid, 12488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 1315 mSDtfsCounter, 11678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI15 SFLT0 conc2 concLT0 SILN0 SILU2 SILI6 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp76 ukn100 mio100 lsp100 div531 bol100 ite100 ukn100 eq146 hnf96 smp40 dnf147 smp98 tf101 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 61ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-06 19:12:40,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2025-02-06 19:12:41,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2025-02-06 19:12:41,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2025-02-06 19:12:41,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-02-06 19:12:41,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2025-02-06 19:12:41,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2025-02-06 19:12:42,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2025-02-06 19:12:42,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2025-02-06 19:12:42,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2025-02-06 19:12:42,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2025-02-06 19:12:42,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:43,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE