./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.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 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:36:37,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:36:37,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:36:37,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:36:37,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:36:37,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:36:37,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:36:37,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:36:37,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:36:37,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:36:37,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:36:37,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:36:37,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:36:37,784 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:36:37,784 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:36:37,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:36:37,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:36:37,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:36:37,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:36:37,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:36:37,786 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:36:37,786 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 -> 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df [2025-03-09 07:36:38,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:36:38,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:36:38,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:36:38,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:36:38,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:36:38,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-03-09 07:36:39,213 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a3705d9/b0c9605de74542eba5add896ccb87520/FLAGd1db4ea43 [2025-03-09 07:36:39,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:36:39,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-03-09 07:36:39,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a3705d9/b0c9605de74542eba5add896ccb87520/FLAGd1db4ea43 [2025-03-09 07:36:39,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a3705d9/b0c9605de74542eba5add896ccb87520 [2025-03-09 07:36:39,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:36:39,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:36:39,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:36:39,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:36:39,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:36:39,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:36:39" (1/1) ... [2025-03-09 07:36:39,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:39, skipping insertion in model container [2025-03-09 07:36:39,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:36:39" (1/1) ... [2025-03-09 07:36:39,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:36:39,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:36:39,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:36:40,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:36:40,041 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:36:40,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40 WrapperNode [2025-03-09 07:36:40,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:36:40,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:36:40,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:36:40,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:36:40,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,090 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 43, calls inlined = 83, statements flattened = 915 [2025-03-09 07:36:40,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:36:40,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:36:40,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:36:40,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:36:40,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,136 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:36:40,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:36:40,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:36:40,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:36:40,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:36:40,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (1/1) ... [2025-03-09 07:36:40,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:36:40,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:36:40,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:36:40,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:36:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:36:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:36:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:36:40,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:36:40,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:36:40,318 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:36:41,042 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-03-09 07:36:41,042 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:36:41,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:36:41,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:36:41,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:36:41 BoogieIcfgContainer [2025-03-09 07:36:41,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:36:41,064 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:36:41,064 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:36:41,068 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:36:41,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:36:41,068 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:36:39" (1/3) ... [2025-03-09 07:36:41,069 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5669fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:36:41, skipping insertion in model container [2025-03-09 07:36:41,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:36:41,069 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:36:40" (2/3) ... [2025-03-09 07:36:41,069 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5669fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:36:41, skipping insertion in model container [2025-03-09 07:36:41,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:36:41,069 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:36:41" (3/3) ... [2025-03-09 07:36:41,070 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-03-09 07:36:41,102 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:36:41,102 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:36:41,102 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:36:41,102 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:36:41,102 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:36:41,103 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:36:41,103 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:36:41,103 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:36:41,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 270 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:41,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2025-03-09 07:36:41,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:41,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:41,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:36:41,141 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-09 07:36:41,141 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:36:41,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 270 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:41,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2025-03-09 07:36:41,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:41,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:41,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:36:41,154 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-09 07:36:41,161 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:41,163 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:41,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash 125398936, now seen corresponding path program 1 times [2025-03-09 07:36:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155806150] [2025-03-09 07:36:41,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:41,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:36:41,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:36:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:41,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:41,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155806150] [2025-03-09 07:36:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155806150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:41,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:41,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:36:41,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121039281] [2025-03-09 07:36:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:41,437 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:36:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -357222546, now seen corresponding path program 1 times [2025-03-09 07:36:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380138858] [2025-03-09 07:36:41,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:41,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 07:36:41,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 07:36:41,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:41,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380138858] [2025-03-09 07:36:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380138858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:41,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600023705] [2025-03-09 07:36:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:41,577 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:41,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:36:41,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:36:41,598 INFO L87 Difference]: Start difference. First operand has 270 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 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-09 07:36:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:41,679 INFO L93 Difference]: Finished difference Result 246 states and 371 transitions. [2025-03-09 07:36:41,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 371 transitions. [2025-03-09 07:36:41,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 204 [2025-03-09 07:36:41,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 221 states and 335 transitions. [2025-03-09 07:36:41,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2025-03-09 07:36:41,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2025-03-09 07:36:41,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 335 transitions. [2025-03-09 07:36:41,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:41,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 221 states and 335 transitions. [2025-03-09 07:36:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 335 transitions. [2025-03-09 07:36:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-09 07:36:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 1.5158371040723981) internal successors, (335), 220 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2025-03-09 07:36:41,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 221 states and 335 transitions. [2025-03-09 07:36:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:36:41,724 INFO L432 stractBuchiCegarLoop]: Abstraction has 221 states and 335 transitions. [2025-03-09 07:36:41,725 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:36:41,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 335 transitions. [2025-03-09 07:36:41,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 204 [2025-03-09 07:36:41,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:41,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:41,730 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-09 07:36:41,730 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-09 07:36:41,731 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:41,731 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:41,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 1 times [2025-03-09 07:36:41,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:41,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378349468] [2025-03-09 07:36:41,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:41,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:41,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:41,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:41,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:41,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:41,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:41,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:41,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:41,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:41,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:41,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -357222546, now seen corresponding path program 2 times [2025-03-09 07:36:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890066923] [2025-03-09 07:36:41,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:36:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:41,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-03-09 07:36:41,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 07:36:41,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:36:41,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890066923] [2025-03-09 07:36:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890066923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892632882] [2025-03-09 07:36:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:41,940 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:41,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:41,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:36:41,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:36:41,943 INFO L87 Difference]: Start difference. First operand 221 states and 335 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-09 07:36:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:41,986 INFO L93 Difference]: Finished difference Result 416 states and 636 transitions. [2025-03-09 07:36:41,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 636 transitions. [2025-03-09 07:36:41,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 399 [2025-03-09 07:36:41,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 416 states and 636 transitions. [2025-03-09 07:36:41,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2025-03-09 07:36:41,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2025-03-09 07:36:41,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 636 transitions. [2025-03-09 07:36:41,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:42,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 416 states and 636 transitions. [2025-03-09 07:36:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 636 transitions. [2025-03-09 07:36:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 251. [2025-03-09 07:36:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 250 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 382 transitions. [2025-03-09 07:36:42,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 382 transitions. [2025-03-09 07:36:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:36:42,012 INFO L432 stractBuchiCegarLoop]: Abstraction has 251 states and 382 transitions. [2025-03-09 07:36:42,012 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:36:42,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 382 transitions. [2025-03-09 07:36:42,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 234 [2025-03-09 07:36:42,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:42,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:42,015 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-09 07:36:42,015 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-09 07:36:42,016 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:42,016 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 2 times [2025-03-09 07:36:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764734187] [2025-03-09 07:36:42,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:36:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:36:42,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,039 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:42,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:42,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1165219616, now seen corresponding path program 1 times [2025-03-09 07:36:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034173033] [2025-03-09 07:36:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 07:36:42,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:36:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:42,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:42,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034173033] [2025-03-09 07:36:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034173033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:42,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:42,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685084156] [2025-03-09 07:36:42,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:42,158 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:42,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:36:42,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:36:42,159 INFO L87 Difference]: Start difference. First operand 251 states and 382 transitions. cyclomatic complexity: 132 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-09 07:36:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:42,180 INFO L93 Difference]: Finished difference Result 461 states and 706 transitions. [2025-03-09 07:36:42,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 706 transitions. [2025-03-09 07:36:42,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 444 [2025-03-09 07:36:42,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 461 states and 706 transitions. [2025-03-09 07:36:42,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 461 [2025-03-09 07:36:42,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 461 [2025-03-09 07:36:42,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 706 transitions. [2025-03-09 07:36:42,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:42,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 461 states and 706 transitions. [2025-03-09 07:36:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 706 transitions. [2025-03-09 07:36:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 286. [2025-03-09 07:36:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 286 states have (on average 1.5244755244755244) internal successors, (436), 285 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 436 transitions. [2025-03-09 07:36:42,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 286 states and 436 transitions. [2025-03-09 07:36:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:36:42,211 INFO L432 stractBuchiCegarLoop]: Abstraction has 286 states and 436 transitions. [2025-03-09 07:36:42,211 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:36:42,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 436 transitions. [2025-03-09 07:36:42,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 269 [2025-03-09 07:36:42,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:42,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:42,214 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-09 07:36:42,214 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-09 07:36:42,214 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:42,214 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:42,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 3 times [2025-03-09 07:36:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293897662] [2025-03-09 07:36:42,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:36:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:36:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:42,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 756395391, now seen corresponding path program 1 times [2025-03-09 07:36:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934616204] [2025-03-09 07:36:42,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 07:36:42,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:36:42,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934616204] [2025-03-09 07:36:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934616204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:42,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:42,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915560923] [2025-03-09 07:36:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:42,384 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:42,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:36:42,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:36:42,384 INFO L87 Difference]: Start difference. First operand 286 states and 436 transitions. cyclomatic complexity: 151 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-09 07:36:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:42,405 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2025-03-09 07:36:42,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 430 transitions. [2025-03-09 07:36:42,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 266 [2025-03-09 07:36:42,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 283 states and 430 transitions. [2025-03-09 07:36:42,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2025-03-09 07:36:42,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2025-03-09 07:36:42,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 430 transitions. [2025-03-09 07:36:42,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:42,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 430 transitions. [2025-03-09 07:36:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 430 transitions. [2025-03-09 07:36:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-09 07:36:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 283 states have (on average 1.519434628975265) internal successors, (430), 282 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 430 transitions. [2025-03-09 07:36:42,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 283 states and 430 transitions. [2025-03-09 07:36:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:36:42,425 INFO L432 stractBuchiCegarLoop]: Abstraction has 283 states and 430 transitions. [2025-03-09 07:36:42,425 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:36:42,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 430 transitions. [2025-03-09 07:36:42,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 266 [2025-03-09 07:36:42,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:42,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:42,427 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-09 07:36:42,427 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-09 07:36:42,427 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:42,428 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:42,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 4 times [2025-03-09 07:36:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219667963] [2025-03-09 07:36:42,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:36:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 07:36:42,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:36:42,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:42,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:42,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1975471532, now seen corresponding path program 1 times [2025-03-09 07:36:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782235763] [2025-03-09 07:36:42,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 07:36:42,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 07:36:42,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:42,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782235763] [2025-03-09 07:36:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782235763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662451768] [2025-03-09 07:36:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:42,613 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:42,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:36:42,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:36:42,614 INFO L87 Difference]: Start difference. First operand 283 states and 430 transitions. cyclomatic complexity: 148 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-09 07:36:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:42,674 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2025-03-09 07:36:42,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 406 transitions. [2025-03-09 07:36:42,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 254 [2025-03-09 07:36:42,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 271 states and 406 transitions. [2025-03-09 07:36:42,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 271 [2025-03-09 07:36:42,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2025-03-09 07:36:42,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 406 transitions. [2025-03-09 07:36:42,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:42,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 406 transitions. [2025-03-09 07:36:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 406 transitions. [2025-03-09 07:36:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-09 07:36:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 1.4981549815498154) internal successors, (406), 270 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 406 transitions. [2025-03-09 07:36:42,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 406 transitions. [2025-03-09 07:36:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:36:42,686 INFO L432 stractBuchiCegarLoop]: Abstraction has 271 states and 406 transitions. [2025-03-09 07:36:42,686 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:36:42,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 406 transitions. [2025-03-09 07:36:42,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 254 [2025-03-09 07:36:42,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:42,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:42,688 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-09 07:36:42,688 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-09 07:36:42,689 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:42,689 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 5 times [2025-03-09 07:36:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210023996] [2025-03-09 07:36:42,690 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:36:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,711 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:36:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:42,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:42,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -464799925, now seen corresponding path program 1 times [2025-03-09 07:36:42,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830296717] [2025-03-09 07:36:42,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:36:42,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:36:42,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:42,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:42,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830296717] [2025-03-09 07:36:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830296717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:42,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881933623] [2025-03-09 07:36:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:42,841 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:42,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:36:42,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:36:42,842 INFO L87 Difference]: Start difference. First operand 271 states and 406 transitions. cyclomatic complexity: 136 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-09 07:36:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:42,896 INFO L93 Difference]: Finished difference Result 259 states and 382 transitions. [2025-03-09 07:36:42,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 382 transitions. [2025-03-09 07:36:42,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 242 [2025-03-09 07:36:42,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 259 states and 382 transitions. [2025-03-09 07:36:42,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2025-03-09 07:36:42,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2025-03-09 07:36:42,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 259 states and 382 transitions. [2025-03-09 07:36:42,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:42,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 259 states and 382 transitions. [2025-03-09 07:36:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states and 382 transitions. [2025-03-09 07:36:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-09 07:36:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 258 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 382 transitions. [2025-03-09 07:36:42,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259 states and 382 transitions. [2025-03-09 07:36:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:36:42,907 INFO L432 stractBuchiCegarLoop]: Abstraction has 259 states and 382 transitions. [2025-03-09 07:36:42,907 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:36:42,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 382 transitions. [2025-03-09 07:36:42,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 242 [2025-03-09 07:36:42,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:42,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:42,909 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-09 07:36:42,909 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-09 07:36:42,909 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:42,909 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret16#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~ret16#1;havoc check_#t~ret16#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:42,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 6 times [2025-03-09 07:36:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204535107] [2025-03-09 07:36:42,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:36:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,921 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,933 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,933 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 07:36:42,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:42,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:42,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:42,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:42,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash 374644452, now seen corresponding path program 1 times [2025-03-09 07:36:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030643203] [2025-03-09 07:36:42,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:42,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:36:42,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:36:42,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030643203] [2025-03-09 07:36:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030643203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:43,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:36:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346600055] [2025-03-09 07:36:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:43,164 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:36:43,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:36:43,164 INFO L87 Difference]: Start difference. First operand 259 states and 382 transitions. cyclomatic complexity: 124 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-09 07:36:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:43,214 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2025-03-09 07:36:43,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 351 transitions. [2025-03-09 07:36:43,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 210 [2025-03-09 07:36:43,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 227 states and 326 transitions. [2025-03-09 07:36:43,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2025-03-09 07:36:43,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2025-03-09 07:36:43,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 326 transitions. [2025-03-09 07:36:43,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:43,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 227 states and 326 transitions. [2025-03-09 07:36:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 326 transitions. [2025-03-09 07:36:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-09 07:36:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 226 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2025-03-09 07:36:43,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 227 states and 326 transitions. [2025-03-09 07:36:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:36:43,225 INFO L432 stractBuchiCegarLoop]: Abstraction has 227 states and 326 transitions. [2025-03-09 07:36:43,225 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:36:43,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 326 transitions. [2025-03-09 07:36:43,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 210 [2025-03-09 07:36:43,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:43,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:43,226 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-09 07:36:43,226 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-09 07:36:43,226 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:43,227 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret18#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~ret18#1 % 256 then 0 else 1);havoc check_#t~ret18#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~ret22#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~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 7 times [2025-03-09 07:36:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217198577] [2025-03-09 07:36:43,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 07:36:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:43,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:43,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:43,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:43,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:43,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1321779113, now seen corresponding path program 1 times [2025-03-09 07:36:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:43,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996190960] [2025-03-09 07:36:43,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:43,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 07:36:43,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 07:36:43,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996190960] [2025-03-09 07:36:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996190960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 07:36:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721495392] [2025-03-09 07:36:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:43,440 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:43,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 07:36:43,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 07:36:43,441 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. cyclomatic complexity: 100 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-09 07:36:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:43,541 INFO L93 Difference]: Finished difference Result 455 states and 653 transitions. [2025-03-09 07:36:43,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 653 transitions. [2025-03-09 07:36:43,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 438 [2025-03-09 07:36:43,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 455 states and 653 transitions. [2025-03-09 07:36:43,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2025-03-09 07:36:43,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2025-03-09 07:36:43,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 455 states and 653 transitions. [2025-03-09 07:36:43,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:43,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 455 states and 653 transitions. [2025-03-09 07:36:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 653 transitions. [2025-03-09 07:36:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 320. [2025-03-09 07:36:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 320 states have (on average 1.403125) internal successors, (449), 319 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 449 transitions. [2025-03-09 07:36:43,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 320 states and 449 transitions. [2025-03-09 07:36:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:36:43,553 INFO L432 stractBuchiCegarLoop]: Abstraction has 320 states and 449 transitions. [2025-03-09 07:36:43,553 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:36:43,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 449 transitions. [2025-03-09 07:36:43,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2025-03-09 07:36:43,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:43,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:43,556 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-09 07:36:43,556 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-09 07:36:43,556 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:43,556 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret18#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~ret18#1 % 256 then 0 else 1);havoc check_#t~ret18#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~ret22#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~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 8 times [2025-03-09 07:36:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708839453] [2025-03-09 07:36:43,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:36:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:43,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:43,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:43,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:36:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:43,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:43,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:43,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:43,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:43,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:43,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1741418632, now seen corresponding path program 1 times [2025-03-09 07:36:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:43,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121834406] [2025-03-09 07:36:43,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:43,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 07:36:43,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 07:36:43,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:43,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121834406] [2025-03-09 07:36:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121834406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:43,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:43,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:36:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405491295] [2025-03-09 07:36:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:43,679 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:43,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:36:43,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:36:43,679 INFO L87 Difference]: Start difference. First operand 320 states and 449 transitions. cyclomatic complexity: 130 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-09 07:36:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:43,721 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-03-09 07:36:43,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 444 transitions. [2025-03-09 07:36:43,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 301 [2025-03-09 07:36:43,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 444 transitions. [2025-03-09 07:36:43,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2025-03-09 07:36:43,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2025-03-09 07:36:43,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 444 transitions. [2025-03-09 07:36:43,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:43,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 318 states and 444 transitions. [2025-03-09 07:36:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 444 transitions. [2025-03-09 07:36:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 227. [2025-03-09 07:36:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 226 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 324 transitions. [2025-03-09 07:36:43,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 227 states and 324 transitions. [2025-03-09 07:36:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:36:43,734 INFO L432 stractBuchiCegarLoop]: Abstraction has 227 states and 324 transitions. [2025-03-09 07:36:43,734 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:36:43,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 324 transitions. [2025-03-09 07:36:43,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 210 [2025-03-09 07:36:43,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:43,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:43,736 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-09 07:36:43,736 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-09 07:36:43,736 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:43,736 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret18#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~ret18#1 % 256 then 0 else 1);havoc check_#t~ret18#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~ret22#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~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 9 times [2025-03-09 07:36:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664422066] [2025-03-09 07:36:43,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:36:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:43,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:43,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:43,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:36:43,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:43,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:43,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:43,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:43,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:43,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1023798180, now seen corresponding path program 1 times [2025-03-09 07:36:43,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296086792] [2025-03-09 07:36:43,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:43,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:43,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 07:36:43,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 07:36:43,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:43,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296086792] [2025-03-09 07:36:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296086792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:44,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:44,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:36:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684869299] [2025-03-09 07:36:44,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:44,160 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:44,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:36:44,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:36:44,160 INFO L87 Difference]: Start difference. First operand 227 states and 324 transitions. cyclomatic complexity: 98 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-09 07:36:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:44,293 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2025-03-09 07:36:44,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 412 transitions. [2025-03-09 07:36:44,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 278 [2025-03-09 07:36:44,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 295 states and 412 transitions. [2025-03-09 07:36:44,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2025-03-09 07:36:44,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2025-03-09 07:36:44,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 412 transitions. [2025-03-09 07:36:44,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:44,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 412 transitions. [2025-03-09 07:36:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 412 transitions. [2025-03-09 07:36:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 232. [2025-03-09 07:36:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 1.418103448275862) internal successors, (329), 231 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 329 transitions. [2025-03-09 07:36:44,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 232 states and 329 transitions. [2025-03-09 07:36:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:36:44,301 INFO L432 stractBuchiCegarLoop]: Abstraction has 232 states and 329 transitions. [2025-03-09 07:36:44,301 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:36:44,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 329 transitions. [2025-03-09 07:36:44,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2025-03-09 07:36:44,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:44,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:44,304 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-09 07:36:44,304 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-09 07:36:44,304 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:44,304 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret18#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~ret18#1 % 256 then 0 else 1);havoc check_#t~ret18#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~ret19#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~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#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~ret22#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~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:44,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 10 times [2025-03-09 07:36:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:44,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062007744] [2025-03-09 07:36:44,305 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:36:44,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:44,312 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 07:36:44,318 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:44,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:36:44,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:44,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:44,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:44,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:44,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:44,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:44,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2125626257, now seen corresponding path program 1 times [2025-03-09 07:36:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998417995] [2025-03-09 07:36:44,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:44,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:36:44,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:36:44,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:44,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:44,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998417995] [2025-03-09 07:36:44,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998417995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:44,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:44,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:36:44,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275860501] [2025-03-09 07:36:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:44,765 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:44,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:36:44,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:36:44,766 INFO L87 Difference]: Start difference. First operand 232 states and 329 transitions. cyclomatic complexity: 98 Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 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-09 07:36:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:44,899 INFO L93 Difference]: Finished difference Result 349 states and 485 transitions. [2025-03-09 07:36:44,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 485 transitions. [2025-03-09 07:36:44,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 332 [2025-03-09 07:36:44,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 349 states and 485 transitions. [2025-03-09 07:36:44,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2025-03-09 07:36:44,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2025-03-09 07:36:44,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 485 transitions. [2025-03-09 07:36:44,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:44,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 349 states and 485 transitions. [2025-03-09 07:36:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 485 transitions. [2025-03-09 07:36:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 268. [2025-03-09 07:36:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 267 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 377 transitions. [2025-03-09 07:36:44,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 268 states and 377 transitions. [2025-03-09 07:36:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:36:44,911 INFO L432 stractBuchiCegarLoop]: Abstraction has 268 states and 377 transitions. [2025-03-09 07:36:44,912 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 07:36:44,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 377 transitions. [2025-03-09 07:36:44,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2025-03-09 07:36:44,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:44,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:44,914 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-09 07:36:44,914 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-09 07:36:44,914 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:44,914 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret18#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~ret18#1 % 256 then 0 else 1);havoc check_#t~ret18#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~ret22#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~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 11 times [2025-03-09 07:36:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:44,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93770946] [2025-03-09 07:36:44,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:36:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:44,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:44,928 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:44,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:36:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:44,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:44,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:44,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:44,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:44,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:44,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash 15301865, now seen corresponding path program 1 times [2025-03-09 07:36:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719563768] [2025-03-09 07:36:44,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:44,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 07:36:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 07:36:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:45,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719563768] [2025-03-09 07:36:45,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719563768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:45,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:45,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:36:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525188133] [2025-03-09 07:36:45,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:45,057 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:36:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:36:45,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:36:45,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:36:45,059 INFO L87 Difference]: Start difference. First operand 268 states and 377 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-09 07:36:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:36:45,073 INFO L93 Difference]: Finished difference Result 234 states and 330 transitions. [2025-03-09 07:36:45,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 330 transitions. [2025-03-09 07:36:45,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 199 [2025-03-09 07:36:45,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 216 states and 302 transitions. [2025-03-09 07:36:45,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2025-03-09 07:36:45,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2025-03-09 07:36:45,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 302 transitions. [2025-03-09 07:36:45,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:36:45,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 216 states and 302 transitions. [2025-03-09 07:36:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 302 transitions. [2025-03-09 07:36:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-03-09 07:36:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 216 states have (on average 1.3981481481481481) internal successors, (302), 215 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:36:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 302 transitions. [2025-03-09 07:36:45,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 216 states and 302 transitions. [2025-03-09 07:36:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:36:45,081 INFO L432 stractBuchiCegarLoop]: Abstraction has 216 states and 302 transitions. [2025-03-09 07:36:45,082 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 07:36:45,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 302 transitions. [2025-03-09 07:36:45,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 199 [2025-03-09 07:36:45,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:36:45,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:36:45,085 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-09 07:36:45,085 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-09 07:36:45,085 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(52, 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~nondet30#1, 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~ret46#1, main_#t~ret47#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~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~side1Failed~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side2Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~side1_written~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side2_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;assume 0 == main_#t~nondet34#1 || 1 == main_#t~nondet34#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet34#1 % 256 then 0 else 1);havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_1~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_2~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;~side2Failed_History_0~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_1~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_2~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~active_side_History_0~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_1~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~manual_selection_History_0~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_2~0 := main_#t~nondet45#1;havoc main_#t~nondet45#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~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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-09 07:36:45,086 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_~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_~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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~nondet6#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet6#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet6#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet6#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~nondet6#1, Side2_activestandby_task_each_pals_period_#t~ret7#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~ret8#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~ret8#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~ret8#1;havoc Pendulum_prism_task_each_pals_period_#t~ret8#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~ret8#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~ret9#1, 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_~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~ret9#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~ret9#1;havoc check_#t~ret9#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~ret14#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~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#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~ret15#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~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#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~ret18#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~ret18#1 % 256 then 0 else 1);havoc check_#t~ret18#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~ret22#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~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret47#1 := check_#res#1;havoc check_#t~ret9#1, 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_~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~ret47#1;havoc main_#t~ret47#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-09 07:36:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -685980910, now seen corresponding path program 12 times [2025-03-09 07:36:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958749197] [2025-03-09 07:36:45,087 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:36:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:45,095 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:45,131 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:45,131 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 07:36:45,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:45,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:36:45,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:36:45,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:45,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:45,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1223419289, now seen corresponding path program 1 times [2025-03-09 07:36:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424319207] [2025-03-09 07:36:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:45,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 07:36:45,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 07:36:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:45,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:36:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 07:36:45,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 07:36:45,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:45,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:36:45,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:36:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:36:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1021474136, now seen corresponding path program 1 times [2025-03-09 07:36:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:36:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429039966] [2025-03-09 07:36:45,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:36:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:36:45,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 07:36:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 07:36:45,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:36:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:36:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:36:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:36:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429039966] [2025-03-09 07:36:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429039966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:36:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:36:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 07:36:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824427229] [2025-03-09 07:36:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:36:50,438 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:36:50,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:36:50,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:36:50,440 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:36:50,440 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:36:50,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:36:50,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:36:50,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:36:50,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c_Iteration13_Loop [2025-03-09 07:36:50,441 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:36:50,441 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:36:50,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:50,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:51,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:36:52,924 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 30