./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.cil.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/systemc/toy.cil.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:35:35,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:35:35,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:35:35,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:35:35,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:35:35,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:35:35,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:35:35,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:35:35,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:35:35,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:35:35,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:35:35,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:35:35,474 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:35:35,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:35:35,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:35:35,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:35:35,475 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:35:35,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:35:35,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:35:35,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:35:35,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:35:35,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:35:35,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:35:35,475 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:35:35,475 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2025-03-09 07:35:35,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:35:35,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:35:35,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:35:35,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:35:35,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:35:35,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2025-03-09 07:35:36,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9adb26a/3039a3fbad684077aa0f6c4875bcefa8/FLAGc32a9f4d8 [2025-03-09 07:35:37,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:35:37,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2025-03-09 07:35:37,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9adb26a/3039a3fbad684077aa0f6c4875bcefa8/FLAGc32a9f4d8 [2025-03-09 07:35:37,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9adb26a/3039a3fbad684077aa0f6c4875bcefa8 [2025-03-09 07:35:37,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:35:37,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:35:37,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:35:37,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:35:37,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:35:37,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37, skipping insertion in model container [2025-03-09 07:35:37,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:35:37,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:35:37,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:35:37,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:35:37,741 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:35:37,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37 WrapperNode [2025-03-09 07:35:37,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:35:37,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:35:37,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:35:37,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:35:37,749 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:35:37" (1/1) ... [2025-03-09 07:35:37,757 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:35:37" (1/1) ... [2025-03-09 07:35:37,782 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 344 [2025-03-09 07:35:37,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:35:37,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:35:37,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:35:37,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:35:37,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,814 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:35:37,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:35:37,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:35:37,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:35:37,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:35:37,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (1/1) ... [2025-03-09 07:35:37,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:37,871 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:35:37,874 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:35:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:35:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:35:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:35:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:35:37,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:35:37,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:35:38,327 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-09 07:35:38,328 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:35:38,339 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:35:38,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:35:38,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:35:38 BoogieIcfgContainer [2025-03-09 07:35:38,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:35:38,342 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:35:38,342 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:35:38,346 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:35:38,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:35:38,346 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:35:37" (1/3) ... [2025-03-09 07:35:38,347 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32409de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:35:38, skipping insertion in model container [2025-03-09 07:35:38,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:35:38,347 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:35:37" (2/3) ... [2025-03-09 07:35:38,347 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32409de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:35:38, skipping insertion in model container [2025-03-09 07:35:38,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:35:38,348 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:35:38" (3/3) ... [2025-03-09 07:35:38,349 INFO L363 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2025-03-09 07:35:38,382 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:35:38,382 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:35:38,382 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:35:38,382 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:35:38,382 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:35:38,382 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:35:38,382 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:35:38,382 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:35:38,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 126 states, 125 states have (on average 1.816) internal successors, (227), 125 states have internal predecessors, (227), 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:35:38,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2025-03-09 07:35:38,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:38,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:38,408 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] [2025-03-09 07:35:38,408 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] [2025-03-09 07:35:38,408 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:35:38,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 126 states, 125 states have (on average 1.816) internal successors, (227), 125 states have internal predecessors, (227), 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:35:38,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2025-03-09 07:35:38,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:38,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:38,414 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] [2025-03-09 07:35:38,414 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] [2025-03-09 07:35:38,419 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume !(1 == ~wl_i~0);~wl_st~0 := 2;" "assume !(1 == ~c1_i~0);~c1_st~0 := 2;" "assume !(1 == ~c2_i~0);~c2_st~0 := 2;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:38,420 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !true;" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -783895034, now seen corresponding path program 1 times [2025-03-09 07:35:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-09 07:35:38,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:38,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:38,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:38,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:38,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:38,639 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:35:38,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:38,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-09 07:35:38,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256298778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363811996] [2025-03-09 07:35:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:38,644 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:38,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2004809762, now seen corresponding path program 1 times [2025-03-09 07:35:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805213264] [2025-03-09 07:35:38,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:38,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:35:38,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:35:38,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:38,667 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:35:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805213264] [2025-03-09 07:35:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805213264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:38,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:38,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:35:38,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964104188] [2025-03-09 07:35:38,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:38,668 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:38,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 07:35:38,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 07:35:38,697 INFO L87 Difference]: Start difference. First operand has 126 states, 125 states have (on average 1.816) internal successors, (227), 125 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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:35:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:38,713 INFO L93 Difference]: Finished difference Result 124 states and 218 transitions. [2025-03-09 07:35:38,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 218 transitions. [2025-03-09 07:35:38,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:38,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 213 transitions. [2025-03-09 07:35:38,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-03-09 07:35:38,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-09 07:35:38,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 213 transitions. [2025-03-09 07:35:38,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:38,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 213 transitions. [2025-03-09 07:35:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 213 transitions. [2025-03-09 07:35:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 07:35:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.7899159663865547) internal successors, (213), 118 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:35:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 213 transitions. [2025-03-09 07:35:38,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 213 transitions. [2025-03-09 07:35:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 07:35:38,753 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 213 transitions. [2025-03-09 07:35:38,753 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:35:38,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 213 transitions. [2025-03-09 07:35:38,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:38,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:38,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:38,758 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] [2025-03-09 07:35:38,758 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] [2025-03-09 07:35:38,758 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume !(1 == ~wl_i~0);~wl_st~0 := 2;" "assume !(1 == ~c1_i~0);~c1_st~0 := 2;" "assume !(1 == ~c2_i~0);~c2_st~0 := 2;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:38,758 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:38,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -783895034, now seen corresponding path program 2 times [2025-03-09 07:35:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210760876] [2025-03-09 07:35:38,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:35:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:38,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:38,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:38,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:35:38,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:38,856 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:35:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:38,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210760876] [2025-03-09 07:35:38,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210760876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:38,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:38,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:38,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284046097] [2025-03-09 07:35:38,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:38,856 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:38,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 957725725, now seen corresponding path program 1 times [2025-03-09 07:35:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-03-09 07:35:38,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:38,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:38,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:38,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:38,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:38,900 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:35:38,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:38,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-03-09 07:35:38,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837612205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:38,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:38,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109840723] [2025-03-09 07:35:38,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:38,901 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:38,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:38,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:38,903 INFO L87 Difference]: Start difference. First operand 119 states and 213 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:35:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:38,919 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2025-03-09 07:35:38,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 212 transitions. [2025-03-09 07:35:38,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:38,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 212 transitions. [2025-03-09 07:35:38,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-03-09 07:35:38,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-09 07:35:38,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2025-03-09 07:35:38,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:38,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 212 transitions. [2025-03-09 07:35:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2025-03-09 07:35:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 07:35:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.781512605042017) internal successors, (212), 118 states have internal predecessors, (212), 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:35:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2025-03-09 07:35:38,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 212 transitions. [2025-03-09 07:35:38,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:38,933 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2025-03-09 07:35:38,934 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:35:38,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2025-03-09 07:35:38,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:38,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:38,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:38,935 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] [2025-03-09 07:35:38,935 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] [2025-03-09 07:35:38,935 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume !(1 == ~c1_i~0);~c1_st~0 := 2;" "assume !(1 == ~c2_i~0);~c2_st~0 := 2;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:38,935 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:38,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -995245947, now seen corresponding path program 1 times [2025-03-09 07:35:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488748842] [2025-03-09 07:35:38,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:38,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:38,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:38,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:38,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:38,977 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:35:38,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:38,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488748842] [2025-03-09 07:35:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488748842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:38,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369354727] [2025-03-09 07:35:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:38,979 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 957725725, now seen corresponding path program 2 times [2025-03-09 07:35:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-03-09 07:35:38,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:35:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:38,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:38,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:38,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:35:38,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,003 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:35:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-03-09 07:35:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741556431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:39,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839109674] [2025-03-09 07:35:39,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,004 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:39,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:39,006 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:35:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:39,016 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2025-03-09 07:35:39,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2025-03-09 07:35:39,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:39,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2025-03-09 07:35:39,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-03-09 07:35:39,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-09 07:35:39,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2025-03-09 07:35:39,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:39,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 211 transitions. [2025-03-09 07:35:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2025-03-09 07:35:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 07:35:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.773109243697479) internal successors, (211), 118 states have internal predecessors, (211), 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:35:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2025-03-09 07:35:39,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 211 transitions. [2025-03-09 07:35:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:39,025 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2025-03-09 07:35:39,025 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:35:39,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2025-03-09 07:35:39,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:39,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:39,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:39,027 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] [2025-03-09 07:35:39,027 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] [2025-03-09 07:35:39,027 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume !(1 == ~c2_i~0);~c2_st~0 := 2;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:39,027 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -586421722, now seen corresponding path program 1 times [2025-03-09 07:35:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105424423] [2025-03-09 07:35:39,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,072 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:35:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105424423] [2025-03-09 07:35:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105424423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104428914] [2025-03-09 07:35:39,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,073 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash 957725725, now seen corresponding path program 3 times [2025-03-09 07:35:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84491901] [2025-03-09 07:35:39,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:35:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:39,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:39,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:35:39,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,098 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:35:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84491901] [2025-03-09 07:35:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84491901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064164597] [2025-03-09 07:35:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,099 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:39,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:39,100 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:35:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:39,108 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2025-03-09 07:35:39,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2025-03-09 07:35:39,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:39,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2025-03-09 07:35:39,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-03-09 07:35:39,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-09 07:35:39,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2025-03-09 07:35:39,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:39,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 210 transitions. [2025-03-09 07:35:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2025-03-09 07:35:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 07:35:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 118 states have internal predecessors, (210), 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:35:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2025-03-09 07:35:39,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 210 transitions. [2025-03-09 07:35:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:39,116 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2025-03-09 07:35:39,116 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:35:39,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2025-03-09 07:35:39,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2025-03-09 07:35:39,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:39,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:39,118 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] [2025-03-09 07:35:39,118 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] [2025-03-09 07:35:39,118 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:39,118 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume 1 == ~wl_pc~0;" "assume 1 == ~e_wl~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash 258050149, now seen corresponding path program 1 times [2025-03-09 07:35:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074474107] [2025-03-09 07:35:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,179 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:35:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074474107] [2025-03-09 07:35:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074474107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:35:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835023896] [2025-03-09 07:35:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,181 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:39,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash 957725725, now seen corresponding path program 4 times [2025-03-09 07:35:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-03-09 07:35:39,182 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:35:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,189 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 07:35:39,194 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:39,195 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 07:35:39,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,210 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:35:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-03-09 07:35:39,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897805888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:39,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44848064] [2025-03-09 07:35:39,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,211 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:35:39,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:35:39,212 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:35:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:39,342 INFO L93 Difference]: Finished difference Result 279 states and 483 transitions. [2025-03-09 07:35:39,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 483 transitions. [2025-03-09 07:35:39,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 237 [2025-03-09 07:35:39,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 279 states and 483 transitions. [2025-03-09 07:35:39,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2025-03-09 07:35:39,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2025-03-09 07:35:39,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 483 transitions. [2025-03-09 07:35:39,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:39,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 483 transitions. [2025-03-09 07:35:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 483 transitions. [2025-03-09 07:35:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 259. [2025-03-09 07:35:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 259 states have (on average 1.7451737451737452) internal successors, (452), 258 states have internal predecessors, (452), 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:35:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 452 transitions. [2025-03-09 07:35:39,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259 states and 452 transitions. [2025-03-09 07:35:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:35:39,358 INFO L432 stractBuchiCegarLoop]: Abstraction has 259 states and 452 transitions. [2025-03-09 07:35:39,358 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:35:39,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 452 transitions. [2025-03-09 07:35:39,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 231 [2025-03-09 07:35:39,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:39,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:39,362 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] [2025-03-09 07:35:39,362 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] [2025-03-09 07:35:39,362 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:39,362 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1576985056, now seen corresponding path program 1 times [2025-03-09 07:35:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330403358] [2025-03-09 07:35:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:39,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:39,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:39,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:39,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1104965118, now seen corresponding path program 1 times [2025-03-09 07:35:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-03-09 07:35:39,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:39,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:39,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,439 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:35:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-03-09 07:35:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935448622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144162236] [2025-03-09 07:35:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,440 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:39,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:39,440 INFO L87 Difference]: Start difference. First operand 259 states and 452 transitions. cyclomatic complexity: 195 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:39,473 INFO L93 Difference]: Finished difference Result 436 states and 759 transitions. [2025-03-09 07:35:39,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 436 states and 759 transitions. [2025-03-09 07:35:39,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 393 [2025-03-09 07:35:39,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 436 states to 436 states and 759 transitions. [2025-03-09 07:35:39,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2025-03-09 07:35:39,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2025-03-09 07:35:39,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 759 transitions. [2025-03-09 07:35:39,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:39,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 436 states and 759 transitions. [2025-03-09 07:35:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 759 transitions. [2025-03-09 07:35:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-09 07:35:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.7442396313364055) internal successors, (757), 433 states have internal predecessors, (757), 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:35:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 757 transitions. [2025-03-09 07:35:39,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 757 transitions. [2025-03-09 07:35:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:39,503 INFO L432 stractBuchiCegarLoop]: Abstraction has 434 states and 757 transitions. [2025-03-09 07:35:39,503 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:35:39,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 757 transitions. [2025-03-09 07:35:39,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 391 [2025-03-09 07:35:39,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:39,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:39,508 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] [2025-03-09 07:35:39,508 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] [2025-03-09 07:35:39,508 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume 1 == ~e_wl~0;~e_wl~0 := 2;" [2025-03-09 07:35:39,508 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume 0 == ~e_wl~0;~e_wl~0 := 1;" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume 1 == ~e_wl~0;~e_wl~0 := 2;" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:39,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1447902336, now seen corresponding path program 1 times [2025-03-09 07:35:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530993365] [2025-03-09 07:35:39,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,561 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:35:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530993365] [2025-03-09 07:35:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530993365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:35:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72412557] [2025-03-09 07:35:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,561 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1104965149, now seen corresponding path program 1 times [2025-03-09 07:35:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-03-09 07:35:39,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:39,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,583 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:35:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-03-09 07:35:39,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701040537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:35:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912001461] [2025-03-09 07:35:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,584 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:35:39,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:35:39,585 INFO L87 Difference]: Start difference. First operand 434 states and 757 transitions. cyclomatic complexity: 325 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:35:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:39,657 INFO L93 Difference]: Finished difference Result 675 states and 1158 transitions. [2025-03-09 07:35:39,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 1158 transitions. [2025-03-09 07:35:39,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 636 [2025-03-09 07:35:39,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 675 states and 1158 transitions. [2025-03-09 07:35:39,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-03-09 07:35:39,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2025-03-09 07:35:39,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 1158 transitions. [2025-03-09 07:35:39,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:39,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 1158 transitions. [2025-03-09 07:35:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 1158 transitions. [2025-03-09 07:35:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 665. [2025-03-09 07:35:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 665 states have (on average 1.7218045112781954) internal successors, (1145), 664 states have internal predecessors, (1145), 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:35:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1145 transitions. [2025-03-09 07:35:39,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 665 states and 1145 transitions. [2025-03-09 07:35:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:35:39,685 INFO L432 stractBuchiCegarLoop]: Abstraction has 665 states and 1145 transitions. [2025-03-09 07:35:39,685 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:35:39,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 665 states and 1145 transitions. [2025-03-09 07:35:39,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 634 [2025-03-09 07:35:39,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:39,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:39,689 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] [2025-03-09 07:35:39,689 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] [2025-03-09 07:35:39,689 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:39,689 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume 0 == ~e_f~0;~e_f~0 := 1;" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume 1 == ~e_f~0;~e_f~0 := 2;" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1576955265, now seen corresponding path program 1 times [2025-03-09 07:35:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-03-09 07:35:39,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,734 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:35:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-03-09 07:35:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594497917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:35:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837023996] [2025-03-09 07:35:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,735 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:39,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1398368125, now seen corresponding path program 1 times [2025-03-09 07:35:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654916518] [2025-03-09 07:35:39,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:39,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:39,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,755 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:35:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654916518] [2025-03-09 07:35:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654916518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:35:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032784114] [2025-03-09 07:35:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,756 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:35:39,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:35:39,756 INFO L87 Difference]: Start difference. First operand 665 states and 1145 transitions. cyclomatic complexity: 484 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:35:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:39,847 INFO L93 Difference]: Finished difference Result 1390 states and 2344 transitions. [2025-03-09 07:35:39,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1390 states and 2344 transitions. [2025-03-09 07:35:39,855 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1334 [2025-03-09 07:35:39,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1390 states to 1390 states and 2344 transitions. [2025-03-09 07:35:39,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1390 [2025-03-09 07:35:39,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1390 [2025-03-09 07:35:39,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1390 states and 2344 transitions. [2025-03-09 07:35:39,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:39,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1390 states and 2344 transitions. [2025-03-09 07:35:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states and 2344 transitions. [2025-03-09 07:35:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1375. [2025-03-09 07:35:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1375 states have (on average 1.6916363636363636) internal successors, (2326), 1374 states have internal predecessors, (2326), 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:35:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2326 transitions. [2025-03-09 07:35:39,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1375 states and 2326 transitions. [2025-03-09 07:35:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:35:39,919 INFO L432 stractBuchiCegarLoop]: Abstraction has 1375 states and 2326 transitions. [2025-03-09 07:35:39,919 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:35:39,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1375 states and 2326 transitions. [2025-03-09 07:35:39,925 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1331 [2025-03-09 07:35:39,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:39,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:39,926 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] [2025-03-09 07:35:39,926 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] [2025-03-09 07:35:39,926 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume 1 == ~e_wl~0;~e_wl~0 := 2;" [2025-03-09 07:35:39,926 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume !(0 == ~e_f~0);" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume 0 == ~e_c~0;~e_c~0 := 1;" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume 1 == ~e_c~0;~r_st~0 := 0;" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume !(1 == ~e_f~0);" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume 1 == ~e_c~0;~e_c~0 := 2;" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:39,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1870388062, now seen corresponding path program 1 times [2025-03-09 07:35:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513243463] [2025-03-09 07:35:39,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:39,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:39,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,958 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:35:39,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513243463] [2025-03-09 07:35:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513243463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:35:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928206086] [2025-03-09 07:35:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,959 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash -44134907, now seen corresponding path program 1 times [2025-03-09 07:35:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844288684] [2025-03-09 07:35:39,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:39,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:39,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:39,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:39,978 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:35:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:39,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844288684] [2025-03-09 07:35:39,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844288684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:39,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:39,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:35:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229517586] [2025-03-09 07:35:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:39,979 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:39,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:35:39,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:35:39,979 INFO L87 Difference]: Start difference. First operand 1375 states and 2326 transitions. cyclomatic complexity: 959 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:35:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:40,035 INFO L93 Difference]: Finished difference Result 1277 states and 2126 transitions. [2025-03-09 07:35:40,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 2126 transitions. [2025-03-09 07:35:40,042 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1237 [2025-03-09 07:35:40,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1277 states and 2126 transitions. [2025-03-09 07:35:40,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1277 [2025-03-09 07:35:40,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1277 [2025-03-09 07:35:40,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1277 states and 2126 transitions. [2025-03-09 07:35:40,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:40,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1277 states and 2126 transitions. [2025-03-09 07:35:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states and 2126 transitions. [2025-03-09 07:35:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1265. [2025-03-09 07:35:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1265 states have (on average 1.6687747035573122) internal successors, (2111), 1264 states have internal predecessors, (2111), 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:35:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2111 transitions. [2025-03-09 07:35:40,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1265 states and 2111 transitions. [2025-03-09 07:35:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:35:40,070 INFO L432 stractBuchiCegarLoop]: Abstraction has 1265 states and 2111 transitions. [2025-03-09 07:35:40,070 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:35:40,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1265 states and 2111 transitions. [2025-03-09 07:35:40,075 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1237 [2025-03-09 07:35:40,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:40,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:40,077 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] [2025-03-09 07:35:40,077 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] [2025-03-09 07:35:40,077 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume 1 == ~e_wl~0;~e_wl~0 := 2;" [2025-03-09 07:35:40,077 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume !(0 == ~e_f~0);" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume !(1 == ~e_f~0);" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1576985055, now seen corresponding path program 1 times [2025-03-09 07:35:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-09 07:35:40,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:40,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:40,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:35:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-09 07:35:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417475484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:40,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662790227] [2025-03-09 07:35:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:40,112 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 337811110, now seen corresponding path program 1 times [2025-03-09 07:35:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-03-09 07:35:40,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:40,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:40,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:40,131 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:35:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-03-09 07:35:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911373916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:40,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:35:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256807346] [2025-03-09 07:35:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:40,132 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:40,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:35:40,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:35:40,132 INFO L87 Difference]: Start difference. First operand 1265 states and 2111 transitions. cyclomatic complexity: 852 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:35:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:40,181 INFO L93 Difference]: Finished difference Result 1054 states and 1743 transitions. [2025-03-09 07:35:40,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1054 states and 1743 transitions. [2025-03-09 07:35:40,186 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1020 [2025-03-09 07:35:40,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1054 states to 1054 states and 1743 transitions. [2025-03-09 07:35:40,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1054 [2025-03-09 07:35:40,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1054 [2025-03-09 07:35:40,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1054 states and 1743 transitions. [2025-03-09 07:35:40,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:40,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1054 states and 1743 transitions. [2025-03-09 07:35:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states and 1743 transitions. [2025-03-09 07:35:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1050. [2025-03-09 07:35:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1050 states have (on average 1.6561904761904762) internal successors, (1739), 1049 states have internal predecessors, (1739), 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:35:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1739 transitions. [2025-03-09 07:35:40,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1050 states and 1739 transitions. [2025-03-09 07:35:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:35:40,230 INFO L432 stractBuchiCegarLoop]: Abstraction has 1050 states and 1739 transitions. [2025-03-09 07:35:40,230 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:35:40,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1050 states and 1739 transitions. [2025-03-09 07:35:40,234 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1020 [2025-03-09 07:35:40,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:40,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:40,234 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] [2025-03-09 07:35:40,234 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] [2025-03-09 07:35:40,234 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:40,234 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume !(0 == ~e_f~0);" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume !(1 == ~e_f~0);" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:40,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1576985056, now seen corresponding path program 2 times [2025-03-09 07:35:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123317673] [2025-03-09 07:35:40,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:35:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:40,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:40,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:35:40,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:40,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:40,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:40,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:40,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:40,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 337811110, now seen corresponding path program 2 times [2025-03-09 07:35:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-03-09 07:35:40,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:35:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:35:40,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:35:40,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:35:40,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:40,262 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:35:40,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:40,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-03-09 07:35:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164213666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:40,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:35:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154427889] [2025-03-09 07:35:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:40,262 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:35:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:40,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:40,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:40,263 INFO L87 Difference]: Start difference. First operand 1050 states and 1739 transitions. cyclomatic complexity: 695 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:40,287 INFO L93 Difference]: Finished difference Result 1540 states and 2517 transitions. [2025-03-09 07:35:40,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1540 states and 2517 transitions. [2025-03-09 07:35:40,293 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1510 [2025-03-09 07:35:40,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1540 states to 1540 states and 2517 transitions. [2025-03-09 07:35:40,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1540 [2025-03-09 07:35:40,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1540 [2025-03-09 07:35:40,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1540 states and 2517 transitions. [2025-03-09 07:35:40,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:35:40,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1540 states and 2517 transitions. [2025-03-09 07:35:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states and 2517 transitions. [2025-03-09 07:35:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1540. [2025-03-09 07:35:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1540 states have (on average 1.6344155844155843) internal successors, (2517), 1539 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2517 transitions. [2025-03-09 07:35:40,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1540 states and 2517 transitions. [2025-03-09 07:35:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:40,325 INFO L432 stractBuchiCegarLoop]: Abstraction has 1540 states and 2517 transitions. [2025-03-09 07:35:40,325 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 07:35:40,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1540 states and 2517 transitions. [2025-03-09 07:35:40,330 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1510 [2025-03-09 07:35:40,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:40,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:40,330 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] [2025-03-09 07:35:40,330 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:35:40,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(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" [2025-03-09 07:35:40,331 INFO L754 eck$LassoCheckResult]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" "assume !(0 == ~wl_st~0);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" "havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;" "assume !(1 == ~c_req_up~0);" "start_simulation_~kernel_st~0#1 := 3;" "assume !(0 == ~e_f~0);" "assume 0 == ~e_g~0;~e_g~0 := 1;" "assume 0 == ~e_e~0;~e_e~0 := 1;" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume 2 == ~wl_pc~0;" "assume 1 == ~e_e~0;~wl_st~0 := 0;" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume 1 == ~e_e~0;~e_e~0 := 2;" "assume !(1 == ~e_f~0);" "assume 1 == ~e_g~0;~e_g~0 := 2;" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "assume 0 == ~wl_st~0;" [2025-03-09 07:35:40,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1576985056, now seen corresponding path program 3 times [2025-03-09 07:35:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275558274] [2025-03-09 07:35:40,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:35:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:40,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:40,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:35:40,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:40,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:40,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:40,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:40,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:40,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:40,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash 509601003, now seen corresponding path program 1 times [2025-03-09 07:35:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257441671] [2025-03-09 07:35:40,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:40,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:35:40,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:35:40,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:40,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:40,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:35:40,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:35:40,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:40,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:40,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:40,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1865535404, now seen corresponding path program 1 times [2025-03-09 07:35:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383422502] [2025-03-09 07:35:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:40,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 07:35:40,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 07:35:40,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:40,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:40,385 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:35:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:40,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383422502] [2025-03-09 07:35:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383422502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:40,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:40,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:40,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243111814] [2025-03-09 07:35:40,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:40,641 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:35:40,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:35:40,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:35:40,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:35:40,642 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:35:40,642 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:40,642 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:35:40,642 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:35:40,643 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration12_Loop [2025-03-09 07:35:40,643 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:35:40,643 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:35:40,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:40,915 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:35:40,916 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:35:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:40,919 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:35:40,920 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:35:40,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:40,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:40,944 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:40,944 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-8} Honda state: {~e_c~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:40,951 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:35:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:40,953 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:35:40,954 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:35:40,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:40,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:40,975 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:40,975 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:40,981 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:35:40,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:40,983 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:35:40,985 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:35:40,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:40,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,006 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,006 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_f~0=-1} Honda state: {~e_f~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,012 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:35:41,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,015 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:35:41,016 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:35:41,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,037 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,037 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,044 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:35:41,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,046 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:35:41,048 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:35:41,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,070 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,070 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_req_up~0=4} Honda state: {~c_req_up~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 07:35:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,078 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:35:41,080 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:35:41,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,094 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,094 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,101 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:35:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,103 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:35:41,105 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:35:41,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,124 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,124 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=-1} Honda state: {~wb_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 07:35:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,133 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:35:41,134 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:35:41,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,154 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,154 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 07:35:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,163 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:35:41,164 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:35:41,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,175 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,175 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 07:35:41,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,183 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:35:41,184 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:35:41,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,196 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,196 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 07:35:41,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,205 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:35:41,206 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:35:41,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,228 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,228 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_pc~0=4} Honda state: {~wb_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,237 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:35:41,239 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:35:41,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,251 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,252 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet5#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,258 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:35:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,260 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:35:41,261 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:35:41,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,273 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,273 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 07:35:41,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,281 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:35:41,282 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:35:41,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,303 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,303 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_pc~0=4} Honda state: {~c2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,313 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:35:41,314 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:35:41,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,327 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,327 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,332 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:35:41,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,335 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:35:41,335 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:35:41,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,356 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:35:41,356 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_wl~0=-1} Honda state: {~e_wl~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:35:41,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 07:35:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,365 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:35:41,368 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:35:41,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:35:41,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,385 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:35:41,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,388 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:35:41,388 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:35:41,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:35:41,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:35:41,409 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:35:41,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,416 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:35:41,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:35:41,416 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:35:41,416 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:35:41,416 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:35:41,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,416 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:35:41,416 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:35:41,416 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration12_Loop [2025-03-09 07:35:41,416 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:35:41,416 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:35:41,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:35:41,666 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:35:41,670 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:35:41,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,673 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:35:41,675 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:35:41,676 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:35:41,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,688 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,694 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,702 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:35:41,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,705 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:35:41,706 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:35:41,707 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:35:41,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,717 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,718 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,725 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:35:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,727 INFO L229 MonitoredProcess]: Starting monitored process 22 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:35:41,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:35:41,730 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:35:41,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,740 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,741 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,751 INFO L229 MonitoredProcess]: Starting monitored process 23 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:35:41,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 07:35:41,753 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:35:41,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:41,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:41,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,773 INFO L229 MonitoredProcess]: Starting monitored process 24 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:35:41,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:35:41,776 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:35:41,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,786 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,787 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 07:35:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,796 INFO L229 MonitoredProcess]: Starting monitored process 25 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:35:41,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:35:41,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:35:41,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:41,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:41,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,820 INFO L229 MonitoredProcess]: Starting monitored process 26 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:35:41,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:35:41,822 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:35:41,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,832 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,832 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 07:35:41,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,841 INFO L229 MonitoredProcess]: Starting monitored process 27 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:35:41,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 07:35:41,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:35:41,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,853 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,853 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 07:35:41,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,863 INFO L229 MonitoredProcess]: Starting monitored process 28 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:35:41,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:35:41,864 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:35:41,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,875 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,876 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:35:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,886 INFO L229 MonitoredProcess]: Starting monitored process 29 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:35:41,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:35:41,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:35:41,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:41,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:41,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,909 INFO L229 MonitoredProcess]: Starting monitored process 30 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:35:41,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:35:41,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:35:41,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,921 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:41,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,922 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:41,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 07:35:41,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,933 INFO L229 MonitoredProcess]: Starting monitored process 31 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:35:41,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:35:41,936 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:35:41,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:41,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:41,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:41,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,956 INFO L229 MonitoredProcess]: Starting monitored process 32 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:35:41,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 07:35:41,960 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:35:41,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:41,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:41,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:41,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 07:35:41,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:41,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:41,981 INFO L229 MonitoredProcess]: Starting monitored process 33 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:35:41,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 07:35:41,984 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:35:41,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:41,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:41,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:41,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:41,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:41,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:41,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:41,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:42,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:42,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:42,006 INFO L229 MonitoredProcess]: Starting monitored process 34 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:35:42,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 07:35:42,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:35:42,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:42,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:42,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:42,019 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:42,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:42,020 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:42,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:42,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:42,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:42,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:42,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:42,031 INFO L229 MonitoredProcess]: Starting monitored process 35 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:35:42,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 07:35:42,034 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:35:42,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:42,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:42,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:42,045 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:35:42,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:42,046 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:35:42,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:42,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:35:42,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:42,056 INFO L229 MonitoredProcess]: Starting monitored process 36 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:35:42,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 07:35:42,059 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:35:42,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:35:42,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:35:42,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:35:42,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:35:42,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:35:42,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:35:42,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:35:42,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:35:42,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:35:42,077 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:35:42,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:35:42,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:35:42,081 INFO L229 MonitoredProcess]: Starting monitored process 37 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:35:42,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 07:35:42,084 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:35:42,084 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:35:42,084 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:35:42,085 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2025-03-09 07:35:42,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-09 07:35:42,093 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:35:42,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:35:42,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:35:42,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:42,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:35:42,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:35:42,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:35:42,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:35:42,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:42,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:35:42,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:35:42,283 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:35:42,288 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 07:35:42,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1540 states and 2517 transitions. cyclomatic complexity: 983 Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:42,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1540 states and 2517 transitions. cyclomatic complexity: 983. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4057 states and 6663 transitions. Complement of second has 5 states. [2025-03-09 07:35:42,390 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:35:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2025-03-09 07:35:42,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 188 transitions. Stem has 24 letters. Loop has 27 letters. [2025-03-09 07:35:42,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:35:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 188 transitions. Stem has 51 letters. Loop has 27 letters. [2025-03-09 07:35:42,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:35:42,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 188 transitions. Stem has 24 letters. Loop has 54 letters. [2025-03-09 07:35:42,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:35:42,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4057 states and 6663 transitions. [2025-03-09 07:35:42,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 07:35:42,458 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2724 [2025-03-09 07:35:42,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4057 states to 4057 states and 6663 transitions. [2025-03-09 07:35:42,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2757 [2025-03-09 07:35:42,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2792 [2025-03-09 07:35:42,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4057 states and 6663 transitions. [2025-03-09 07:35:42,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:35:42,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4057 states and 6663 transitions. [2025-03-09 07:35:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states and 6663 transitions. [2025-03-09 07:35:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 4022. [2025-03-09 07:35:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4022 states have (on average 1.6419691695673795) internal successors, (6604), 4021 states have internal predecessors, (6604), 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:35:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 6604 transitions. [2025-03-09 07:35:42,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4022 states and 6604 transitions. [2025-03-09 07:35:42,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:42,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:42,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:42,546 INFO L87 Difference]: Start difference. First operand 4022 states and 6604 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:42,581 INFO L93 Difference]: Finished difference Result 3167 states and 5184 transitions. [2025-03-09 07:35:42,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3167 states and 5184 transitions. [2025-03-09 07:35:42,599 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2154 [2025-03-09 07:35:42,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3167 states to 3167 states and 5184 transitions. [2025-03-09 07:35:42,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2187 [2025-03-09 07:35:42,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2187 [2025-03-09 07:35:42,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3167 states and 5184 transitions. [2025-03-09 07:35:42,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:35:42,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3167 states and 5184 transitions. [2025-03-09 07:35:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states and 5184 transitions. [2025-03-09 07:35:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3069. [2025-03-09 07:35:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 3069 states have (on average 1.6363636363636365) internal successors, (5022), 3068 states have internal predecessors, (5022), 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:35:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 5022 transitions. [2025-03-09 07:35:42,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3069 states and 5022 transitions. [2025-03-09 07:35:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:42,670 INFO L432 stractBuchiCegarLoop]: Abstraction has 3069 states and 5022 transitions. [2025-03-09 07:35:42,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 07:35:42,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3069 states and 5022 transitions. [2025-03-09 07:35:42,679 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2087 [2025-03-09 07:35:42,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:42,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:42,680 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] [2025-03-09 07:35:42,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:35:42,680 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-03-09 07:35:42,680 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~wl_st~0;" "assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~c1_st~0);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" [2025-03-09 07:35:42,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1641896672, now seen corresponding path program 1 times [2025-03-09 07:35:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147641364] [2025-03-09 07:35:42,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:42,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:42,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:42,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:42,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:42,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:42,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:42,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:42,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1348883019, now seen corresponding path program 1 times [2025-03-09 07:35:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-03-09 07:35:42,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:42,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:35:42,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:35:42,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:42,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:35:42,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:35:42,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:42,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1844893194, now seen corresponding path program 1 times [2025-03-09 07:35:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571637744] [2025-03-09 07:35:42,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:42,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 07:35:42,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:35:42,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:42,721 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:35:42,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571637744] [2025-03-09 07:35:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571637744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:42,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059902435] [2025-03-09 07:35:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:42,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:42,744 INFO L87 Difference]: Start difference. First operand 3069 states and 5022 transitions. cyclomatic complexity: 1965 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:35:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:42,780 INFO L93 Difference]: Finished difference Result 4718 states and 7669 transitions. [2025-03-09 07:35:42,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4718 states and 7669 transitions. [2025-03-09 07:35:42,800 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3236 [2025-03-09 07:35:42,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4718 states to 4718 states and 7669 transitions. [2025-03-09 07:35:42,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3273 [2025-03-09 07:35:42,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3273 [2025-03-09 07:35:42,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4718 states and 7669 transitions. [2025-03-09 07:35:42,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:35:42,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4718 states and 7669 transitions. [2025-03-09 07:35:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states and 7669 transitions. [2025-03-09 07:35:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4718. [2025-03-09 07:35:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 4718 states have (on average 1.62547689699025) internal successors, (7669), 4717 states have internal predecessors, (7669), 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:35:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 7669 transitions. [2025-03-09 07:35:42,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4718 states and 7669 transitions. [2025-03-09 07:35:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:42,908 INFO L432 stractBuchiCegarLoop]: Abstraction has 4718 states and 7669 transitions. [2025-03-09 07:35:42,908 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 07:35:42,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4718 states and 7669 transitions. [2025-03-09 07:35:42,923 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3236 [2025-03-09 07:35:42,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:42,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:42,924 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] [2025-03-09 07:35:42,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:35:42,925 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-03-09 07:35:42,925 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~wl_st~0;" "assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume !(0 == ~c2_st~0);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" [2025-03-09 07:35:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1641896672, now seen corresponding path program 2 times [2025-03-09 07:35:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062056245] [2025-03-09 07:35:42,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:35:42,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:42,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:42,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:42,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:35:42,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:42,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:42,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:42,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1133993389, now seen corresponding path program 1 times [2025-03-09 07:35:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691313729] [2025-03-09 07:35:42,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:42,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:35:42,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:35:42,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:42,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:35:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:35:42,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:42,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1357420148, now seen corresponding path program 1 times [2025-03-09 07:35:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18975316] [2025-03-09 07:35:42,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:42,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 07:35:42,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 07:35:42,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:42,962 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:35:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18975316] [2025-03-09 07:35:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18975316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:42,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:42,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556626330] [2025-03-09 07:35:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:42,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:42,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:42,993 INFO L87 Difference]: Start difference. First operand 4718 states and 7669 transitions. cyclomatic complexity: 2963 Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:35:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:43,038 INFO L93 Difference]: Finished difference Result 7303 states and 11705 transitions. [2025-03-09 07:35:43,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7303 states and 11705 transitions. [2025-03-09 07:35:43,075 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5058 [2025-03-09 07:35:43,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7303 states to 7303 states and 11705 transitions. [2025-03-09 07:35:43,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5103 [2025-03-09 07:35:43,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5103 [2025-03-09 07:35:43,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7303 states and 11705 transitions. [2025-03-09 07:35:43,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:35:43,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7303 states and 11705 transitions. [2025-03-09 07:35:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states and 11705 transitions. [2025-03-09 07:35:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7303. [2025-03-09 07:35:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 7303 states have (on average 1.6027659865808572) internal successors, (11705), 7302 states have internal predecessors, (11705), 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:35:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 11705 transitions. [2025-03-09 07:35:43,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7303 states and 11705 transitions. [2025-03-09 07:35:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:43,280 INFO L432 stractBuchiCegarLoop]: Abstraction has 7303 states and 11705 transitions. [2025-03-09 07:35:43,280 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 07:35:43,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7303 states and 11705 transitions. [2025-03-09 07:35:43,304 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5058 [2025-03-09 07:35:43,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:43,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:43,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:35:43,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:35:43,305 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-03-09 07:35:43,306 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~wl_st~0;" "assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___1~0#1);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" [2025-03-09 07:35:43,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1641896672, now seen corresponding path program 3 times [2025-03-09 07:35:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-03-09 07:35:43,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:35:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:43,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:43,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:43,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:35:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:43,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:43,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:43,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:43,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:43,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 794046697, now seen corresponding path program 1 times [2025-03-09 07:35:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355369288] [2025-03-09 07:35:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:43,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:35:43,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:35:43,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:43,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:43,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:43,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:35:43,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:35:43,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:43,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash 869638378, now seen corresponding path program 1 times [2025-03-09 07:35:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-03-09 07:35:43,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 07:35:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:35:43,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:43,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:43,343 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:35:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-03-09 07:35:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396012816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544977398] [2025-03-09 07:35:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:43,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:43,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:43,368 INFO L87 Difference]: Start difference. First operand 7303 states and 11705 transitions. cyclomatic complexity: 4414 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:35:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:43,425 INFO L93 Difference]: Finished difference Result 12393 states and 19595 transitions. [2025-03-09 07:35:43,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12393 states and 19595 transitions. [2025-03-09 07:35:43,483 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8612 [2025-03-09 07:35:43,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12393 states to 12393 states and 19595 transitions. [2025-03-09 07:35:43,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8695 [2025-03-09 07:35:43,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8695 [2025-03-09 07:35:43,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12393 states and 19595 transitions. [2025-03-09 07:35:43,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:35:43,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12393 states and 19595 transitions. [2025-03-09 07:35:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12393 states and 19595 transitions. [2025-03-09 07:35:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12393 to 12393. [2025-03-09 07:35:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12393 states, 12393 states have (on average 1.5811345114177358) internal successors, (19595), 12392 states have internal predecessors, (19595), 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:35:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12393 states to 12393 states and 19595 transitions. [2025-03-09 07:35:43,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12393 states and 19595 transitions. [2025-03-09 07:35:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:43,772 INFO L432 stractBuchiCegarLoop]: Abstraction has 12393 states and 19595 transitions. [2025-03-09 07:35:43,772 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 07:35:43,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12393 states and 19595 transitions. [2025-03-09 07:35:43,805 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8612 [2025-03-09 07:35:43,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:43,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:43,805 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] [2025-03-09 07:35:43,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:35:43,806 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume !(1 == ~wb_i~0);~wb_st~0 := 2;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-03-09 07:35:43,806 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~wl_st~0;" "assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___1~0#1);" "assume !(0 == ~wb_st~0);" "assume !(0 == ~r_st~0);" [2025-03-09 07:35:43,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash 797424801, now seen corresponding path program 1 times [2025-03-09 07:35:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-03-09 07:35:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:43,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:43,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:43,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:43,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:35:43,820 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:35:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:35:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-03-09 07:35:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373904381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:35:43,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:35:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:35:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132313502] [2025-03-09 07:35:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:35:43,821 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:35:43,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash 794046697, now seen corresponding path program 2 times [2025-03-09 07:35:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341690196] [2025-03-09 07:35:43,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:35:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:43,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:35:43,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:35:43,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:35:43,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:43,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:43,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:35:43,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:35:43,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:43,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:43,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:43,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:35:43,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:35:43,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:35:43,849 INFO L87 Difference]: Start difference. First operand 12393 states and 19595 transitions. cyclomatic complexity: 7214 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:35:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:35:43,888 INFO L93 Difference]: Finished difference Result 12371 states and 19560 transitions. [2025-03-09 07:35:43,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12371 states and 19560 transitions. [2025-03-09 07:35:43,934 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8612 [2025-03-09 07:35:43,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12371 states to 12371 states and 19560 transitions. [2025-03-09 07:35:43,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8673 [2025-03-09 07:35:43,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8673 [2025-03-09 07:35:43,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12371 states and 19560 transitions. [2025-03-09 07:35:43,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:35:43,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12371 states and 19560 transitions. [2025-03-09 07:35:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12371 states and 19560 transitions. [2025-03-09 07:35:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12371 to 12371. [2025-03-09 07:35:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12371 states, 12371 states have (on average 1.581117128768895) internal successors, (19560), 12370 states have internal predecessors, (19560), 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:35:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 19560 transitions. [2025-03-09 07:35:44,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12371 states and 19560 transitions. [2025-03-09 07:35:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:35:44,231 INFO L432 stractBuchiCegarLoop]: Abstraction has 12371 states and 19560 transitions. [2025-03-09 07:35:44,231 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 07:35:44,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12371 states and 19560 transitions. [2025-03-09 07:35:44,266 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8612 [2025-03-09 07:35:44,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:35:44,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:35:44,266 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] [2025-03-09 07:35:44,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:35:44,266 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~c_req_up~0);" "assume 1 == ~wl_i~0;~wl_st~0 := 0;" "assume 1 == ~c1_i~0;~c1_st~0 := 0;" "assume 1 == ~c2_i~0;~c2_st~0 := 0;" "assume 1 == ~wb_i~0;~wb_st~0 := 0;" "assume !(1 == ~r_i~0);~r_st~0 := 2;" "assume !(0 == ~e_f~0);" "assume !(0 == ~e_g~0);" "assume !(0 == ~e_e~0);" "assume !(0 == ~e_c~0);" "assume !(0 == ~e_wl~0);" "assume !(1 == ~wl_pc~0);" "assume !(2 == ~wl_pc~0);" "assume !(1 == ~c1_pc~0);" "assume !(1 == ~c2_pc~0);" "assume !(1 == ~wb_pc~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_e~0);" "assume !(1 == ~e_f~0);" "assume !(1 == ~e_g~0);" "assume !(1 == ~e_c~0);" "assume !(1 == ~e_wl~0);" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1;" [2025-03-09 07:35:44,267 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~wl_st~0;" "assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___1~0#1);" "assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1;" "assume !(0 != eval_~tmp___2~0#1);" "assume !(0 == ~r_st~0);" [2025-03-09 07:35:44,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1641896672, now seen corresponding path program 4 times [2025-03-09 07:35:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:44,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848228311] [2025-03-09 07:35:44,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:35:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:44,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-09 07:35:44,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:44,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:35:44,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:44,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:44,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:44,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:44,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:44,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:44,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1154356615, now seen corresponding path program 1 times [2025-03-09 07:35:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713111264] [2025-03-09 07:35:44,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:44,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:35:44,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:35:44,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:44,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:44,282 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:44,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:35:44,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:35:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:44,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:44,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:44,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:35:44,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1188985496, now seen corresponding path program 1 times [2025-03-09 07:35:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:35:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200103557] [2025-03-09 07:35:44,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:35:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:35:44,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 07:35:44,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 07:35:44,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:44,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:44,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:44,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 07:35:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 07:35:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:44,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:35:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:45,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:45,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:45,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:45,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:35:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:35:45,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:35:45,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:35:45,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:35:45,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:35:45 BoogieIcfgContainer [2025-03-09 07:35:45,249 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:35:45,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:35:45,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:35:45,250 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:35:45,251 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:35:38" (3/4) ... [2025-03-09 07:35:45,252 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:35:45,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:35:45,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:35:45,311 INFO L158 Benchmark]: Toolchain (without parser) took 7846.60ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 105.8MB in the beginning and 303.4MB in the end (delta: -197.6MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2025-03-09 07:35:45,311 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:35:45,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.46ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:35:45,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.82ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:35:45,311 INFO L158 Benchmark]: Boogie Preprocessor took 44.49ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:35:45,311 INFO L158 Benchmark]: IcfgBuilder took 506.72ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 63.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 07:35:45,312 INFO L158 Benchmark]: BuchiAutomizer took 6907.43ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 62.0MB in the beginning and 311.4MB in the end (delta: -249.3MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. [2025-03-09 07:35:45,312 INFO L158 Benchmark]: Witness Printer took 60.42ms. Allocated memory is still 562.0MB. Free memory was 311.4MB in the beginning and 303.4MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:35:45,313 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.28ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.46ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.82ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.49ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 506.72ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 63.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 6907.43ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 62.0MB in the beginning and 311.4MB in the end (delta: -249.3MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. * Witness Printer took 60.42ms. Allocated memory is still 562.0MB. Free memory was 311.4MB in the beginning and 303.4MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. 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 17 terminating modules (16 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * e_e) + 1) and consists of 3 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 12371 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 17 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 6. Automata minimization 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 196 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.5s 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, 3854 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3853 mSDsluCounter, 6288 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2360 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 3928 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI9 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf100 smp100 dnf166 smp73 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 300]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 300]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 07:35:45,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)