./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:42:52,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:42:52,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:42:52,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:42:52,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:42:52,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:42:52,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:42:52,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:42:52,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:42:52,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:42:52,391 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:42:52,391 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:42:52,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:42:52,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:42:52,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:42:52,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:42:52,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:42:52,393 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:42:52,393 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2025-03-09 07:42:52,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:42:52,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:42:52,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:42:52,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:42:52,622 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:42:52,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2025-03-09 07:42:53,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818184353/27f234878d474691af1d943daf7210b1/FLAG6c1a44ee2 [2025-03-09 07:42:53,986 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:42:53,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2025-03-09 07:42:53,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818184353/27f234878d474691af1d943daf7210b1/FLAG6c1a44ee2 [2025-03-09 07:42:54,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818184353/27f234878d474691af1d943daf7210b1 [2025-03-09 07:42:54,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:42:54,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:42:54,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:42:54,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:42:54,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:42:54,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b3ea5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54, skipping insertion in model container [2025-03-09 07:42:54,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:42:54,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:42:54,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:42:54,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:42:54,539 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:42:54,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54 WrapperNode [2025-03-09 07:42:54,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:42:54,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:42:54,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:42:54,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:42:54,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,583 INFO L138 Inliner]: procedures = 22, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 474 [2025-03-09 07:42:54,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:42:54,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:42:54,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:42:54,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:42:54,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,610 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-03-09 07:42:54,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:42:54,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:42:54,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:42:54,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:42:54,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (1/1) ... [2025-03-09 07:42:54,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:54,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:42:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:42:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:42:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:42:54,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:42:54,756 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:42:54,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:42:55,140 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-09 07:42:55,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:42:55,150 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:42:55,150 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:42:55,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:42:55 BoogieIcfgContainer [2025-03-09 07:42:55,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:42:55,151 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:42:55,151 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:42:55,156 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:42:55,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:42:55,157 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:42:54" (1/3) ... [2025-03-09 07:42:55,157 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e82c23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:42:55, skipping insertion in model container [2025-03-09 07:42:55,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:42:55,158 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:42:54" (2/3) ... [2025-03-09 07:42:55,158 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e82c23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:42:55, skipping insertion in model container [2025-03-09 07:42:55,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:42:55,158 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:42:55" (3/3) ... [2025-03-09 07:42:55,159 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2025-03-09 07:42:55,189 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:42:55,190 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:42:55,190 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:42:55,190 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:42:55,190 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:42:55,190 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:42:55,190 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:42:55,190 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:42:55,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.7674418604651163) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:55,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2025-03-09 07:42:55,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:42:55,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:42:55,210 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] [2025-03-09 07:42:55,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:42:55,210 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:42:55,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.7674418604651163) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:55,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2025-03-09 07:42:55,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:42:55,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:42:55,215 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] [2025-03-09 07:42:55,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:42:55,221 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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume 0 == assume_abort_if_not_~cond#1;assume false;" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-09 07:42:55,221 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 1);" "~mode1~0 := 1;" "havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1;" [2025-03-09 07:42:55,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1925971969, now seen corresponding path program 1 times [2025-03-09 07:42:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570665185] [2025-03-09 07:42:55,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:55,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:42:55,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:42:55,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:55,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:42:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570665185] [2025-03-09 07:42:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570665185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:42:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:42:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:42:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899309763] [2025-03-09 07:42:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:42:55,477 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:42:55,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:55,479 INFO L85 PathProgramCache]: Analyzing trace with hash -209341640, now seen corresponding path program 1 times [2025-03-09 07:42:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269283199] [2025-03-09 07:42:55,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:55,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:55,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:42:55,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:42:55,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:55,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:42:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269283199] [2025-03-09 07:42:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269283199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:42:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:42:55,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 07:42:55,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238905844] [2025-03-09 07:42:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:42:55,673 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:42:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:42:55,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:42:55,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:42:55,701 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.7674418604651163) internal successors, (228), 129 states have internal predecessors, (228), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:42:55,753 INFO L93 Difference]: Finished difference Result 132 states and 228 transitions. [2025-03-09 07:42:55,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 228 transitions. [2025-03-09 07:42:55,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2025-03-09 07:42:55,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 125 states and 213 transitions. [2025-03-09 07:42:55,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-03-09 07:42:55,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-03-09 07:42:55,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 213 transitions. [2025-03-09 07:42:55,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:42:55,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 213 transitions. [2025-03-09 07:42:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 213 transitions. [2025-03-09 07:42:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-09 07:42:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.704) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 213 transitions. [2025-03-09 07:42:55,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 213 transitions. [2025-03-09 07:42:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:42:55,786 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 213 transitions. [2025-03-09 07:42:55,786 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:42:55,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 213 transitions. [2025-03-09 07:42:55,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2025-03-09 07:42:55,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:42:55,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:42:55,789 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] [2025-03-09 07:42:55,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2025-03-09 07:42:55,789 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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-09 07:42:55,789 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 1);" "~mode1~0 := 1;" "havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1;" [2025-03-09 07:42:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1925972000, now seen corresponding path program 1 times [2025-03-09 07:42:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678891135] [2025-03-09 07:42:55,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:55,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:42:55,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:42:55,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:55,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:55,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:42:55,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678891135] [2025-03-09 07:42:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678891135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:42:55,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:42:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 07:42:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096532203] [2025-03-09 07:42:55,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:42:55,946 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:42:55,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1181213678, now seen corresponding path program 1 times [2025-03-09 07:42:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:55,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41259007] [2025-03-09 07:42:55,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:55,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:42:55,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:42:55,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:55,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:42:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41259007] [2025-03-09 07:42:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41259007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:42:55,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:42:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:42:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992844874] [2025-03-09 07:42:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:42:55,969 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:42:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:42:55,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:42:55,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:42:55,971 INFO L87 Difference]: Start difference. First operand 125 states and 213 transitions. cyclomatic complexity: 89 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:42:56,025 INFO L93 Difference]: Finished difference Result 128 states and 215 transitions. [2025-03-09 07:42:56,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 215 transitions. [2025-03-09 07:42:56,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2025-03-09 07:42:56,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 125 states and 183 transitions. [2025-03-09 07:42:56,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-03-09 07:42:56,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-03-09 07:42:56,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 183 transitions. [2025-03-09 07:42:56,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:42:56,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-03-09 07:42:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 183 transitions. [2025-03-09 07:42:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-09 07:42:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2025-03-09 07:42:56,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-03-09 07:42:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:42:56,038 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-03-09 07:42:56,038 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:42:56,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2025-03-09 07:42:56,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2025-03-09 07:42:56,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:42:56,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:42:56,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:42:56,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2025-03-09 07:42:56,042 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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;" "assume ~id1~0 >= 0;" "assume ~id2~0 >= 0;" "assume ~id3~0 >= 0;" "assume 0 == ~r1~0;" "assume 0 == ~r2~0;" "assume 0 == ~r3~0;" "assume 0 != init_~r122~0#1 % 256;" "assume 0 != init_~r132~0#1 % 256;" "assume 0 != init_~r212~0#1 % 256;" "assume 0 != init_~r232~0#1 % 256;" "assume 0 != init_~r312~0#1 % 256;" "assume 0 != init_~r322~0#1 % 256;" "assume ~max1~0 == ~id1~0;" "assume ~max2~0 == ~id2~0;" "assume ~max3~0 == ~id3~0;" "assume 0 == ~st1~0;" "assume 0 == ~st2~0;" "assume 0 == ~st3~0;" "assume 0 == ~nl1~0;" "assume 0 == ~nl2~0;" "assume 0 == ~nl3~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);" "assume 0 != ~newmax1~0 % 256;" "assume 0 != ~newmax2~0 % 256;" "assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-09 07:42:56,042 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 1);" "~mode1~0 := 1;" "havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1;" [2025-03-09 07:42:56,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:56,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1243571863, now seen corresponding path program 1 times [2025-03-09 07:42:56,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:56,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220147104] [2025-03-09 07:42:56,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:56,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:42:56,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:42:56,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:56,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:42:56,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:42:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:42:56,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:42:56,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:56,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:42:56,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:42:56,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1181213678, now seen corresponding path program 2 times [2025-03-09 07:42:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118729336] [2025-03-09 07:42:56,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:42:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:56,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:42:56,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:42:56,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:42:56,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:42:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118729336] [2025-03-09 07:42:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118729336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:42:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:42:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:42:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657738360] [2025-03-09 07:42:56,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:42:56,267 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:42:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:42:56,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:42:56,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:42:56,268 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:42:56,309 INFO L93 Difference]: Finished difference Result 175 states and 258 transitions. [2025-03-09 07:42:56,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 258 transitions. [2025-03-09 07:42:56,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2025-03-09 07:42:56,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 175 states and 258 transitions. [2025-03-09 07:42:56,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2025-03-09 07:42:56,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2025-03-09 07:42:56,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 258 transitions. [2025-03-09 07:42:56,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:42:56,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 258 transitions. [2025-03-09 07:42:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 258 transitions. [2025-03-09 07:42:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-09 07:42:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2025-03-09 07:42:56,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 258 transitions. [2025-03-09 07:42:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:42:56,325 INFO L432 stractBuchiCegarLoop]: Abstraction has 175 states and 258 transitions. [2025-03-09 07:42:56,326 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:42:56,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 258 transitions. [2025-03-09 07:42:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2025-03-09 07:42:56,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:42:56,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:42:56,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:42:56,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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, 1] [2025-03-09 07:42:56,331 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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1, main_#t~post36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;assume 0 == main_#t~nondet17#1 || 1 == main_#t~nondet17#1;~newmax1~0 := (if 0 == main_#t~nondet17#1 % 256 then 0 else 1);havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;assume 0 == main_#t~nondet24#1 || 1 == main_#t~nondet24#1;~mode2~0 := (if 0 == main_#t~nondet24#1 % 256 then 0 else 1);havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;assume 0 == main_#t~nondet25#1 || 1 == main_#t~nondet25#1;~newmax2~0 := (if 0 == main_#t~nondet25#1 % 256 then 0 else 1);havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~mode3~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;assume 0 == main_#t~nondet33#1 || 1 == main_#t~nondet33#1;~newmax3~0 := (if 0 == main_#t~nondet33#1 % 256 then 0 else 1);havoc main_#t~nondet33#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;" "assume ~id1~0 >= 0;" "assume ~id2~0 >= 0;" "assume ~id3~0 >= 0;" "assume 0 == ~r1~0;" "assume 0 == ~r2~0;" "assume 0 == ~r3~0;" "assume 0 != init_~r122~0#1 % 256;" "assume 0 != init_~r132~0#1 % 256;" "assume 0 != init_~r212~0#1 % 256;" "assume 0 != init_~r232~0#1 % 256;" "assume 0 != init_~r312~0#1 % 256;" "assume 0 != init_~r322~0#1 % 256;" "assume ~max1~0 == ~id1~0;" "assume ~max2~0 == ~id2~0;" "assume ~max3~0 == ~id3~0;" "assume 0 == ~st1~0;" "assume 0 == ~st2~0;" "assume 0 == ~st3~0;" "assume 0 == ~nl1~0;" "assume 0 == ~nl2~0;" "assume 0 == ~nl3~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);" "assume 0 != ~newmax1~0 % 256;" "assume 0 != ~newmax2~0 % 256;" "assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1;" "init_#res#1 := init_~tmp___5~0#1;" "main_#t~ret34#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-09 07:42:56,331 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 1);" "~mode1~0 := 1;" "havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret35#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post36#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post36#1;havoc main_#t~post36#1;" [2025-03-09 07:42:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1243571863, now seen corresponding path program 2 times [2025-03-09 07:42:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551369767] [2025-03-09 07:42:56,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:42:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:56,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:42:56,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:42:56,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:42:56,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:42:56,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:42:56,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:42:56,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:42:56,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:56,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:42:56,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:42:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2036724910, now seen corresponding path program 1 times [2025-03-09 07:42:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888752011] [2025-03-09 07:42:56,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:42:56,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:42:56,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:56,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:42:56,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:42:56,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:42:56,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:42:56,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:56,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:42:56,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:42:56,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1149581052, now seen corresponding path program 1 times [2025-03-09 07:42:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:42:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185707636] [2025-03-09 07:42:56,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:42:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:42:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 07:42:56,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 07:42:56,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:56,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:42:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185707636] [2025-03-09 07:42:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185707636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:42:56,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:42:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:42:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197643741] [2025-03-09 07:42:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:42:57,042 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:42:57,043 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:42:57,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:42:57,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:42:57,043 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:42:57,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:42:57,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:42:57,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2025-03-09 07:42:57,043 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:42:57,044 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:42:57,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,403 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:42:57,404 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:42:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:42:57,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:42:57,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:42:57,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 07:42:57,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:42:57,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:42:57,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:42:57,517 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:42:57,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:42:57,522 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:42:57,522 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:42:57,522 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:42:57,522 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:42:57,522 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:42:57,522 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,522 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:42:57,522 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:42:57,522 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2025-03-09 07:42:57,522 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:42:57,522 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:42:57,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:42:57,845 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:42:57,851 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:42:57,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:42:57,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:57,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:57,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:57,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:57,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:57,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:57,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:57,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:57,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:57,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:57,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:42:57,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:57,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:57,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:57,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:57,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:57,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:57,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:57,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:57,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:57,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:57,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:42:57,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:57,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:57,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:57,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:57,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:57,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:57,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:57,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:57,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:57,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:57,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:42:57,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:57,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:57,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:57,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:57,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:57,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:57,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:57,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:57,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:57,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:57,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,964 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:42:57,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:57,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:57,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:57,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:57,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:57,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:57,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:57,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:57,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:57,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:57,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:57,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:57,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:42:57,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:57,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:57,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:57,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:57,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:57,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,012 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:42:58,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,035 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:42:58,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:58,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,060 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:42:58,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 07:42:58,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:42:58,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:58,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:42:58,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,133 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:42:58,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-03-09 07:42:58,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 07:42:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,155 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:42:58,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 07:42:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,178 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:42:58,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 07:42:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,200 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:42:58,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-09 07:42:58,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,222 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 07:42:58,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:42:58,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 07:42:58,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,243 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:42:58,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:42:58,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:42:58,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:42:58,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:42:58,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:42:58,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:42:58,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:42:58,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:42:58,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:42:58,259 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:42:58,261 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:42:58,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:42:58,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:42:58,264 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:42:58,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:42:58,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:42:58,265 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:42:58,265 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:42:58,266 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2025-03-09 07:42:58,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 07:42:58,273 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:42:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:42:58,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:42:58,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:42:58,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:58,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:58,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:42:58,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:42:58,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:42:58,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:42:58,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:42:58,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:42:58,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:42:58,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:42:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:42:58,522 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:42:58,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 258 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:58,572 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 258 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 289 states and 438 transitions. Complement of second has 4 states. [2025-03-09 07:42:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:42:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2025-03-09 07:42:58,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 48 letters. Loop has 27 letters. [2025-03-09 07:42:58,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:42:58,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 75 letters. Loop has 27 letters. [2025-03-09 07:42:58,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:42:58,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 48 letters. Loop has 54 letters. [2025-03-09 07:42:58,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:42:58,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 438 transitions. [2025-03-09 07:42:58,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:42:58,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 0 states and 0 transitions. [2025-03-09 07:42:58,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:42:58,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:42:58,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:42:58,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:42:58,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:42:58,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:42:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:42:58,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:42:58,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:42:58,587 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:42:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:42:58,587 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-09 07:42:58,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-09 07:42:58,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:42:58,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 07:42:58,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:42:58,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:42:58,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:42:58,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:42:58,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:42:58,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:42:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 07:42:58,589 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:42:58,589 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:42:58,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:42:58,589 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:42:58,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:42:58,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:42:58 BoogieIcfgContainer [2025-03-09 07:42:58,597 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:42:58,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:42:58,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:42:58,598 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:42:58,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:42:55" (3/4) ... [2025-03-09 07:42:58,601 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:42:58,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:42:58,602 INFO L158 Benchmark]: Toolchain (without parser) took 4308.34ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.1MB in the beginning and 142.0MB in the end (delta: -38.9MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2025-03-09 07:42:58,602 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:42:58,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.22ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 86.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:42:58,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.95ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 82.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:42:58,603 INFO L158 Benchmark]: Boogie Preprocessor took 37.23ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:42:58,603 INFO L158 Benchmark]: IcfgBuilder took 528.76ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 44.7MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 07:42:58,603 INFO L158 Benchmark]: BuchiAutomizer took 3446.21ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 44.7MB in the beginning and 142.1MB in the end (delta: -97.4MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2025-03-09 07:42:58,604 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 310.4MB. Free memory was 142.1MB in the beginning and 142.0MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:42:58,604 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.22ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 86.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.95ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 82.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.23ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 528.76ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 44.7MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3446.21ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 44.7MB in the beginning and 142.1MB in the end (delta: -97.4MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 310.4MB. Free memory was 142.1MB in the beginning and 142.0MB in the end (delta: 37.0kB). 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 2375 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1516 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 859 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp35 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 07:42:58,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 07:42:58,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE