./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:22:02,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:22:02,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:22:02,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:22:02,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:22:02,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:22:02,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:22:02,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:22:02,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:22:02,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:22:02,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:22:02,186 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:22:02,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:22:02,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:22:02,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:22:02,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:22:02,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:22:02,187 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:22:02,187 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 -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2025-03-04 16:22:02,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:22:02,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:22:02,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:22:02,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:22:02,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:22:02,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2025-03-04 16:22:03,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d80a7251/4aa333afdf774a57a8fefbb7b29309d1/FLAG794d44511 [2025-03-04 16:22:03,942 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:22:03,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2025-03-04 16:22:03,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d80a7251/4aa333afdf774a57a8fefbb7b29309d1/FLAG794d44511 [2025-03-04 16:22:04,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d80a7251/4aa333afdf774a57a8fefbb7b29309d1 [2025-03-04 16:22:04,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:22:04,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:22:04,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:22:04,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:22:04,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:22:04,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3981c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04, skipping insertion in model container [2025-03-04 16:22:04,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:22:04,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:22:04,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:22:04,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:22:04,564 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:22:04,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04 WrapperNode [2025-03-04 16:22:04,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:22:04,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:22:04,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:22:04,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:22:04,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,625 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 44, calls inlined = 84, statements flattened = 922 [2025-03-04 16:22:04,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:22:04,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:22:04,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:22:04,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:22:04,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,666 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-04 16:22:04,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:22:04,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:22:04,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:22:04,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:22:04,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (1/1) ... [2025-03-04 16:22:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:22:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:22:04,730 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-04 16:22:04,734 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-04 16:22:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:22:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:22:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:22:04,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:22:04,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:22:04,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:22:05,587 INFO L? ?]: Removed 308 outVars from TransFormulas that were not future-live. [2025-03-04 16:22:05,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:22:05,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:22:05,601 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:22:05,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:22:05 BoogieIcfgContainer [2025-03-04 16:22:05,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:22:05,602 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:22:05,602 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:22:05,606 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:22:05,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:22:05,607 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:22:04" (1/3) ... [2025-03-04 16:22:05,608 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44c871a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:22:05, skipping insertion in model container [2025-03-04 16:22:05,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:22:05,608 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:22:04" (2/3) ... [2025-03-04 16:22:05,608 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44c871a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:22:05, skipping insertion in model container [2025-03-04 16:22:05,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:22:05,609 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:22:05" (3/3) ... [2025-03-04 16:22:05,609 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2025-03-04 16:22:05,654 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:22:05,654 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:22:05,654 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:22:05,654 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:22:05,654 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:22:05,655 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:22:05,656 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:22:05,656 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:22:05,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 272 states, 271 states have (on average 1.5608856088560885) internal successors, (423), 271 states have internal predecessors, (423), 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-04 16:22:05,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 252 [2025-03-04 16:22:05,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:05,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:05,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:22:05,701 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:05,701 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:22:05,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 272 states, 271 states have (on average 1.5608856088560885) internal successors, (423), 271 states have internal predecessors, (423), 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-04 16:22:05,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 252 [2025-03-04 16:22:05,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:05,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:05,714 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:22:05,714 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:05,720 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume 0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296);init_#res#1 := 0;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:05,724 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume 0 == ~side1Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:05,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 214149304, now seen corresponding path program 1 times [2025-03-04 16:22:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700616510] [2025-03-04 16:22:05,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:05,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:22:05,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:22:05,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:06,002 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-04 16:22:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700616510] [2025-03-04 16:22:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700616510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:06,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:22:06,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233111251] [2025-03-04 16:22:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:06,009 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:22:06,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -458775151, now seen corresponding path program 1 times [2025-03-04 16:22:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166949169] [2025-03-04 16:22:06,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 16:22:06,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 16:22:06,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:06,119 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-04 16:22:06,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166949169] [2025-03-04 16:22:06,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166949169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:06,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:06,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:06,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284716987] [2025-03-04 16:22:06,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:06,120 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:06,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:22:06,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:22:06,144 INFO L87 Difference]: Start difference. First operand has 272 states, 271 states have (on average 1.5608856088560885) internal successors, (423), 271 states have internal predecessors, (423), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:22:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:06,210 INFO L93 Difference]: Finished difference Result 248 states and 373 transitions. [2025-03-04 16:22:06,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 373 transitions. [2025-03-04 16:22:06,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2025-03-04 16:22:06,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 223 states and 337 transitions. [2025-03-04 16:22:06,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2025-03-04 16:22:06,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2025-03-04 16:22:06,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 337 transitions. [2025-03-04 16:22:06,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:06,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 223 states and 337 transitions. [2025-03-04 16:22:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 337 transitions. [2025-03-04 16:22:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 16:22:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 223 states have (on average 1.5112107623318385) internal successors, (337), 222 states have internal predecessors, (337), 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-04 16:22:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 337 transitions. [2025-03-04 16:22:06,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 337 transitions. [2025-03-04 16:22:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:22:06,261 INFO L432 stractBuchiCegarLoop]: Abstraction has 223 states and 337 transitions. [2025-03-04 16:22:06,261 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:22:06,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 337 transitions. [2025-03-04 16:22:06,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2025-03-04 16:22:06,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:06,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:06,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,263 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,264 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:06,264 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume 0 == ~side1Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:06,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 1 times [2025-03-04 16:22:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633077312] [2025-03-04 16:22:06,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:06,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:06,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash -458775151, now seen corresponding path program 2 times [2025-03-04 16:22:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555106098] [2025-03-04 16:22:06,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:22:06,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-03-04 16:22:06,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 16:22:06,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:22:06,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:06,458 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-04 16:22:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555106098] [2025-03-04 16:22:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555106098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:06,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:06,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978548193] [2025-03-04 16:22:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:06,460 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:06,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:22:06,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:22:06,461 INFO L87 Difference]: Start difference. First operand 223 states and 337 transitions. cyclomatic complexity: 115 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-04 16:22:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:06,486 INFO L93 Difference]: Finished difference Result 416 states and 634 transitions. [2025-03-04 16:22:06,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 634 transitions. [2025-03-04 16:22:06,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 399 [2025-03-04 16:22:06,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 416 states and 634 transitions. [2025-03-04 16:22:06,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2025-03-04 16:22:06,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2025-03-04 16:22:06,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 634 transitions. [2025-03-04 16:22:06,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:06,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 416 states and 634 transitions. [2025-03-04 16:22:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 634 transitions. [2025-03-04 16:22:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 251. [2025-03-04 16:22:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 251 states have (on average 1.5139442231075697) internal successors, (380), 250 states have internal predecessors, (380), 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-04 16:22:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 380 transitions. [2025-03-04 16:22:06,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 380 transitions. [2025-03-04 16:22:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:22:06,503 INFO L432 stractBuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2025-03-04 16:22:06,503 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:22:06,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 380 transitions. [2025-03-04 16:22:06,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 234 [2025-03-04 16:22:06,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:06,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:06,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,506 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:06,506 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume 0 == ~side2Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:06,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 2 times [2025-03-04 16:22:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027737704] [2025-03-04 16:22:06,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:22:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:22:06,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:06,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1982911139, now seen corresponding path program 1 times [2025-03-04 16:22:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659918417] [2025-03-04 16:22:06,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 16:22:06,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 16:22:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:06,632 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-04 16:22:06,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659918417] [2025-03-04 16:22:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659918417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:06,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833982680] [2025-03-04 16:22:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:06,634 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:06,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:22:06,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:22:06,635 INFO L87 Difference]: Start difference. First operand 251 states and 380 transitions. cyclomatic complexity: 130 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-04 16:22:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:06,665 INFO L93 Difference]: Finished difference Result 461 states and 702 transitions. [2025-03-04 16:22:06,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 702 transitions. [2025-03-04 16:22:06,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 444 [2025-03-04 16:22:06,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 461 states and 702 transitions. [2025-03-04 16:22:06,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 461 [2025-03-04 16:22:06,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 461 [2025-03-04 16:22:06,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 702 transitions. [2025-03-04 16:22:06,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:06,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 461 states and 702 transitions. [2025-03-04 16:22:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 702 transitions. [2025-03-04 16:22:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 282. [2025-03-04 16:22:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 281 states have internal predecessors, (426), 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-04 16:22:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 426 transitions. [2025-03-04 16:22:06,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 426 transitions. [2025-03-04 16:22:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:22:06,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 282 states and 426 transitions. [2025-03-04 16:22:06,692 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:22:06,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 426 transitions. [2025-03-04 16:22:06,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 265 [2025-03-04 16:22:06,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:06,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:06,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,695 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:06,695 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:06,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 3 times [2025-03-04 16:22:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731295961] [2025-03-04 16:22:06,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:22:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:22:06,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1903231932, now seen corresponding path program 1 times [2025-03-04 16:22:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107039684] [2025-03-04 16:22:06,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 16:22:06,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 16:22:06,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:06,868 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-04 16:22:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107039684] [2025-03-04 16:22:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107039684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915205261] [2025-03-04 16:22:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:06,869 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:06,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:22:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:22:06,869 INFO L87 Difference]: Start difference. First operand 282 states and 426 transitions. cyclomatic complexity: 145 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-04 16:22:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:06,889 INFO L93 Difference]: Finished difference Result 279 states and 420 transitions. [2025-03-04 16:22:06,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 420 transitions. [2025-03-04 16:22:06,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 262 [2025-03-04 16:22:06,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 279 states and 420 transitions. [2025-03-04 16:22:06,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2025-03-04 16:22:06,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2025-03-04 16:22:06,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 420 transitions. [2025-03-04 16:22:06,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:06,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 420 transitions. [2025-03-04 16:22:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 420 transitions. [2025-03-04 16:22:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-04 16:22:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 1.5053763440860215) internal successors, (420), 278 states have internal predecessors, (420), 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-04 16:22:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 420 transitions. [2025-03-04 16:22:06,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 279 states and 420 transitions. [2025-03-04 16:22:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:22:06,909 INFO L432 stractBuchiCegarLoop]: Abstraction has 279 states and 420 transitions. [2025-03-04 16:22:06,909 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:22:06,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 420 transitions. [2025-03-04 16:22:06,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 262 [2025-03-04 16:22:06,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:06,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:06,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:06,911 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:06,912 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:06,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 4 times [2025-03-04 16:22:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184459635] [2025-03-04 16:22:06,914 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:22:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 16:22:06,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:22:06,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:06,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:06,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:06,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:06,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:06,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1127301361, now seen corresponding path program 1 times [2025-03-04 16:22:06,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:06,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626653218] [2025-03-04 16:22:06,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:06,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 16:22:06,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 16:22:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:07,054 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-04 16:22:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626653218] [2025-03-04 16:22:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626653218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:07,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324946510] [2025-03-04 16:22:07,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:07,055 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:07,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:22:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:22:07,056 INFO L87 Difference]: Start difference. First operand 279 states and 420 transitions. cyclomatic complexity: 142 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:22:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:07,110 INFO L93 Difference]: Finished difference Result 267 states and 396 transitions. [2025-03-04 16:22:07,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 396 transitions. [2025-03-04 16:22:07,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2025-03-04 16:22:07,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 267 states and 396 transitions. [2025-03-04 16:22:07,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2025-03-04 16:22:07,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2025-03-04 16:22:07,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 396 transitions. [2025-03-04 16:22:07,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:07,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 396 transitions. [2025-03-04 16:22:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 396 transitions. [2025-03-04 16:22:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-04 16:22:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 267 states have (on average 1.4831460674157304) internal successors, (396), 266 states have internal predecessors, (396), 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-04 16:22:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 396 transitions. [2025-03-04 16:22:07,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 267 states and 396 transitions. [2025-03-04 16:22:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:22:07,126 INFO L432 stractBuchiCegarLoop]: Abstraction has 267 states and 396 transitions. [2025-03-04 16:22:07,126 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:22:07,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states and 396 transitions. [2025-03-04 16:22:07,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2025-03-04 16:22:07,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:07,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:07,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,128 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:07,128 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 5 times [2025-03-04 16:22:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114745013] [2025-03-04 16:22:07,129 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:22:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,137 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,151 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,151 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:22:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:07,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2133488200, now seen corresponding path program 1 times [2025-03-04 16:22:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91062004] [2025-03-04 16:22:07,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 16:22:07,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 16:22:07,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:07,256 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-04 16:22:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91062004] [2025-03-04 16:22:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91062004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928610204] [2025-03-04 16:22:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:07,257 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:07,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:22:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:22:07,258 INFO L87 Difference]: Start difference. First operand 267 states and 396 transitions. cyclomatic complexity: 130 Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-04 16:22:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:07,309 INFO L93 Difference]: Finished difference Result 255 states and 372 transitions. [2025-03-04 16:22:07,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 372 transitions. [2025-03-04 16:22:07,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2025-03-04 16:22:07,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 255 states and 372 transitions. [2025-03-04 16:22:07,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2025-03-04 16:22:07,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255 [2025-03-04 16:22:07,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 372 transitions. [2025-03-04 16:22:07,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:07,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 255 states and 372 transitions. [2025-03-04 16:22:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 372 transitions. [2025-03-04 16:22:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-04 16:22:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 1.4588235294117646) internal successors, (372), 254 states have internal predecessors, (372), 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-04 16:22:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 372 transitions. [2025-03-04 16:22:07,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 372 transitions. [2025-03-04 16:22:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:22:07,322 INFO L432 stractBuchiCegarLoop]: Abstraction has 255 states and 372 transitions. [2025-03-04 16:22:07,322 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:22:07,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 372 transitions. [2025-03-04 16:22:07,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2025-03-04 16:22:07,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:07,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:07,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,325 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:07,325 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 6 times [2025-03-04 16:22:07,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684725543] [2025-03-04 16:22:07,326 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:22:07,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,332 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,342 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,342 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:22:07,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:07,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:07,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash -682802297, now seen corresponding path program 1 times [2025-03-04 16:22:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061736441] [2025-03-04 16:22:07,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 16:22:07,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 16:22:07,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:07,573 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-04 16:22:07,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061736441] [2025-03-04 16:22:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061736441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:07,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:22:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129725237] [2025-03-04 16:22:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:07,574 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:07,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:22:07,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:22:07,574 INFO L87 Difference]: Start difference. First operand 255 states and 372 transitions. cyclomatic complexity: 118 Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:22:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:07,619 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2025-03-04 16:22:07,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 341 transitions. [2025-03-04 16:22:07,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2025-03-04 16:22:07,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 223 states and 316 transitions. [2025-03-04 16:22:07,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2025-03-04 16:22:07,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2025-03-04 16:22:07,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 316 transitions. [2025-03-04 16:22:07,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:07,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 223 states and 316 transitions. [2025-03-04 16:22:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 316 transitions. [2025-03-04 16:22:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 16:22:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 223 states have (on average 1.4170403587443947) internal successors, (316), 222 states have internal predecessors, (316), 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-04 16:22:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2025-03-04 16:22:07,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 316 transitions. [2025-03-04 16:22:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:22:07,629 INFO L432 stractBuchiCegarLoop]: Abstraction has 223 states and 316 transitions. [2025-03-04 16:22:07,629 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:22:07,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 316 transitions. [2025-03-04 16:22:07,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2025-03-04 16:22:07,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:07,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:07,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,630 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:07,630 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:07,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 7 times [2025-03-04 16:22:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529009501] [2025-03-04 16:22:07,632 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:22:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:07,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -132762412, now seen corresponding path program 1 times [2025-03-04 16:22:07,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423959517] [2025-03-04 16:22:07,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 16:22:07,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 16:22:07,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:07,801 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-04 16:22:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423959517] [2025-03-04 16:22:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423959517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:22:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662715389] [2025-03-04 16:22:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:07,801 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:07,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:22:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:22:07,802 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. cyclomatic complexity: 94 Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-04 16:22:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:07,914 INFO L93 Difference]: Finished difference Result 447 states and 633 transitions. [2025-03-04 16:22:07,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 447 states and 633 transitions. [2025-03-04 16:22:07,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 430 [2025-03-04 16:22:07,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 447 states to 447 states and 633 transitions. [2025-03-04 16:22:07,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 447 [2025-03-04 16:22:07,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2025-03-04 16:22:07,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 447 states and 633 transitions. [2025-03-04 16:22:07,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:07,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 447 states and 633 transitions. [2025-03-04 16:22:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states and 633 transitions. [2025-03-04 16:22:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 316. [2025-03-04 16:22:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.389240506329114) internal successors, (439), 315 states have internal predecessors, (439), 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-04 16:22:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 439 transitions. [2025-03-04 16:22:07,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 439 transitions. [2025-03-04 16:22:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:22:07,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 316 states and 439 transitions. [2025-03-04 16:22:07,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:22:07,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 439 transitions. [2025-03-04 16:22:07,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 299 [2025-03-04 16:22:07,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:07,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:07,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:07,933 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:07,933 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_1~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 8 times [2025-03-04 16:22:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583946106] [2025-03-04 16:22:07,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:22:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:22:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:07,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:07,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 758360731, now seen corresponding path program 1 times [2025-03-04 16:22:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880310959] [2025-03-04 16:22:07,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:07,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 16:22:08,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 16:22:08,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:08,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:08,082 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-04 16:22:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:08,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880310959] [2025-03-04 16:22:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880310959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:08,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:22:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131616735] [2025-03-04 16:22:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:08,083 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:22:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:22:08,084 INFO L87 Difference]: Start difference. First operand 316 states and 439 transitions. cyclomatic complexity: 124 Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:22:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:08,120 INFO L93 Difference]: Finished difference Result 314 states and 434 transitions. [2025-03-04 16:22:08,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 314 states and 434 transitions. [2025-03-04 16:22:08,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 297 [2025-03-04 16:22:08,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 314 states to 314 states and 434 transitions. [2025-03-04 16:22:08,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2025-03-04 16:22:08,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2025-03-04 16:22:08,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 434 transitions. [2025-03-04 16:22:08,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:08,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 314 states and 434 transitions. [2025-03-04 16:22:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 434 transitions. [2025-03-04 16:22:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 223. [2025-03-04 16:22:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 223 states have (on average 1.4080717488789238) internal successors, (314), 222 states have internal predecessors, (314), 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-04 16:22:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 314 transitions. [2025-03-04 16:22:08,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 314 transitions. [2025-03-04 16:22:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:22:08,136 INFO L432 stractBuchiCegarLoop]: Abstraction has 223 states and 314 transitions. [2025-03-04 16:22:08,136 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:22:08,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 314 transitions. [2025-03-04 16:22:08,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2025-03-04 16:22:08,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:08,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:08,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:08,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:08,138 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:08,138 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 9 times [2025-03-04 16:22:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411305261] [2025-03-04 16:22:08,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:22:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:08,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:08,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:08,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:22:08,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:08,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:08,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:08,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:08,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:08,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:08,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash -840049255, now seen corresponding path program 1 times [2025-03-04 16:22:08,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:08,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75831239] [2025-03-04 16:22:08,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:08,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 16:22:08,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 16:22:08,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:08,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:08,505 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-04 16:22:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75831239] [2025-03-04 16:22:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75831239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 16:22:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135562887] [2025-03-04 16:22:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:08,505 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:08,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:22:08,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:22:08,506 INFO L87 Difference]: Start difference. First operand 223 states and 314 transitions. cyclomatic complexity: 92 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-04 16:22:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:08,651 INFO L93 Difference]: Finished difference Result 291 states and 402 transitions. [2025-03-04 16:22:08,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 291 states and 402 transitions. [2025-03-04 16:22:08,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 274 [2025-03-04 16:22:08,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 291 states to 291 states and 402 transitions. [2025-03-04 16:22:08,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2025-03-04 16:22:08,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-03-04 16:22:08,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 402 transitions. [2025-03-04 16:22:08,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:08,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 402 transitions. [2025-03-04 16:22:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 402 transitions. [2025-03-04 16:22:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 228. [2025-03-04 16:22:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 228 states have (on average 1.3991228070175439) internal successors, (319), 227 states have internal predecessors, (319), 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-04 16:22:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 319 transitions. [2025-03-04 16:22:08,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 228 states and 319 transitions. [2025-03-04 16:22:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:22:08,664 INFO L432 stractBuchiCegarLoop]: Abstraction has 228 states and 319 transitions. [2025-03-04 16:22:08,664 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:22:08,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 319 transitions. [2025-03-04 16:22:08,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 211 [2025-03-04 16:22:08,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:08,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:08,665 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:08,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:08,665 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:08,665 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume 0 == check_~tmp___11~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret20#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___12~0#1 := (if 0 == check_#t~ret20#1 % 256 then 0 else 1);havoc check_#t~ret20#1;" "assume !(0 != check_~tmp___12~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:08,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 10 times [2025-03-04 16:22:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:08,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529926306] [2025-03-04 16:22:08,666 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:22:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:08,672 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 16:22:08,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:08,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:22:08,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:08,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:08,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:08,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:08,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:08,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:08,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash -292526292, now seen corresponding path program 1 times [2025-03-04 16:22:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:08,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986918681] [2025-03-04 16:22:08,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 16:22:08,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:22:08,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:08,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:09,161 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-04 16:22:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986918681] [2025-03-04 16:22:09,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986918681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:09,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:09,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 16:22:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077892316] [2025-03-04 16:22:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:09,162 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:09,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:22:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:22:09,162 INFO L87 Difference]: Start difference. First operand 228 states and 319 transitions. cyclomatic complexity: 92 Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-04 16:22:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:09,312 INFO L93 Difference]: Finished difference Result 334 states and 457 transitions. [2025-03-04 16:22:09,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 457 transitions. [2025-03-04 16:22:09,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 312 [2025-03-04 16:22:09,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 329 states and 452 transitions. [2025-03-04 16:22:09,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 329 [2025-03-04 16:22:09,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2025-03-04 16:22:09,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 452 transitions. [2025-03-04 16:22:09,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:09,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 329 states and 452 transitions. [2025-03-04 16:22:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 452 transitions. [2025-03-04 16:22:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 284. [2025-03-04 16:22:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 284 states have (on average 1.3838028169014085) internal successors, (393), 283 states have internal predecessors, (393), 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-04 16:22:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 393 transitions. [2025-03-04 16:22:09,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 284 states and 393 transitions. [2025-03-04 16:22:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 16:22:09,321 INFO L432 stractBuchiCegarLoop]: Abstraction has 284 states and 393 transitions. [2025-03-04 16:22:09,321 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:22:09,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 393 transitions. [2025-03-04 16:22:09,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 267 [2025-03-04 16:22:09,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:09,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:09,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:09,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:09,323 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:09,323 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume !(0 == check_~tmp___8~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:09,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 11 times [2025-03-04 16:22:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660604141] [2025-03-04 16:22:09,324 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:22:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:09,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:09,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:09,340 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:22:09,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:09,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:09,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:09,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1848401830, now seen corresponding path program 1 times [2025-03-04 16:22:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120014956] [2025-03-04 16:22:09,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:09,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 16:22:09,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 16:22:09,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:09,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:09,465 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-04 16:22:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120014956] [2025-03-04 16:22:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120014956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:22:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120942286] [2025-03-04 16:22:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:09,467 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:22:09,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:22:09,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:22:09,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:22:09,468 INFO L87 Difference]: Start difference. First operand 284 states and 393 transitions. cyclomatic complexity: 110 Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-04 16:22:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:22:09,500 INFO L93 Difference]: Finished difference Result 230 states and 320 transitions. [2025-03-04 16:22:09,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 320 transitions. [2025-03-04 16:22:09,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 197 [2025-03-04 16:22:09,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 214 states and 296 transitions. [2025-03-04 16:22:09,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2025-03-04 16:22:09,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2025-03-04 16:22:09,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 296 transitions. [2025-03-04 16:22:09,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:22:09,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 214 states and 296 transitions. [2025-03-04 16:22:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 296 transitions. [2025-03-04 16:22:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 16:22:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 214 states have (on average 1.3831775700934579) internal successors, (296), 213 states have internal predecessors, (296), 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-04 16:22:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 296 transitions. [2025-03-04 16:22:09,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 214 states and 296 transitions. [2025-03-04 16:22:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:22:09,507 INFO L432 stractBuchiCegarLoop]: Abstraction has 214 states and 296 transitions. [2025-03-04 16:22:09,507 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:22:09,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 296 transitions. [2025-03-04 16:22:09,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 197 [2025-03-04 16:22:09,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:22:09,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:22:09,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:09,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:22:09,509 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(54, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-04 16:22:09,509 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume !(0 != ~side1Failed~0 % 256);Side1_activestandby_task_each_pals_period_~side1~0#1 := ~s1s1_old~0;~s1s1_old~0 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~s2s1_old~0;~s2s1_old~0 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := ~cs1_old~0;~cs1_old~0 := ~nomsg~0;" "assume Side1_activestandby_task_each_pals_period_~side1~0#1 == Side1_activestandby_task_each_pals_period_~side2~0#1;Side1_activestandby_task_each_pals_period_~next_state~0#1 := 1;" "~s1s1_new~0 := (if (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s1_new~0) % 256 <= 127 then (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s1_new~0) % 256 else (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s2_new~0) % 256 <= 127 then (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s2_new~0) % 256 else (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1p_new~0) % 256 <= 127 then (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1p_new~0) % 256 else (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1p_new~0) % 256 - 256);~side1_written~0 := Side1_activestandby_task_each_pals_period_~next_state~0#1;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume 0 == ~side1Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume 0 == check_~tmp___11~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret20#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___12~0#1 := (if 0 == check_#t~ret20#1 % 256 then 0 else 1);havoc check_#t~ret20#1;" "assume !(0 != check_~tmp___12~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-03-04 16:22:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 932298773, now seen corresponding path program 12 times [2025-03-04 16:22:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:09,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143027525] [2025-03-04 16:22:09,511 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:22:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:09,518 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:09,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:09,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:22:09,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:09,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:09,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:22:09,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:22:09,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:09,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:09,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:09,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1148898974, now seen corresponding path program 1 times [2025-03-04 16:22:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:09,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639003470] [2025-03-04 16:22:09,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:09,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:09,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 16:22:09,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 16:22:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:09,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:22:09,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 16:22:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 16:22:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:22:09,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:22:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:22:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1712559154, now seen corresponding path program 1 times [2025-03-04 16:22:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:22:09,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202693977] [2025-03-04 16:22:09,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:22:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:22:09,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 16:22:09,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 16:22:09,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:22:09,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:22:09,741 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-04 16:22:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:22:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202693977] [2025-03-04 16:22:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202693977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:22:09,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:22:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:22:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198960170] [2025-03-04 16:22:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:22:14,590 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:22:14,591 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:22:14,591 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:22:14,591 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:22:14,591 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:22:14,591 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:22:14,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:22:14,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:22:14,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c_Iteration13_Loop [2025-03-04 16:22:14,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:22:14,592 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:22:14,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:14,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:15,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:22:16,695 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 26