./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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_Triplicated.1.ufo.BOUNDED-10.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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:40:10,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:40:10,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:40:10,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:40:10,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:40:10,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:40:10,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:40:10,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:40:10,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:40:10,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:40:10,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:40:10,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:40:10,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:40:10,881 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:40:10,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:40:10,881 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:40:10,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:40:10,882 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:40:10,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:40:10,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:40:10,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:40:10,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:40:10,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:40:10,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:40:10,882 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:40:10,882 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2025-03-17 20:40:11,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:40:11,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:40:11,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:40:11,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:40:11,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:40:11,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2025-03-17 20:40:12,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510b32fd3/00cb4c953e37441faf24a3a9435e66db/FLAGcef5e98f9 [2025-03-17 20:40:12,534 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:40:12,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2025-03-17 20:40:12,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510b32fd3/00cb4c953e37441faf24a3a9435e66db/FLAGcef5e98f9 [2025-03-17 20:40:12,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510b32fd3/00cb4c953e37441faf24a3a9435e66db [2025-03-17 20:40:12,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:40:12,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:40:12,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:40:12,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:40:12,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:40:12,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bd965c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12, skipping insertion in model container [2025-03-17 20:40:12,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:40:12,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:40:12,749 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:40:12,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:40:12,803 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:40:12,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12 WrapperNode [2025-03-17 20:40:12,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:40:12,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:40:12,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:40:12,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:40:12,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,864 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 42, calls inlined = 121, statements flattened = 1608 [2025-03-17 20:40:12,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:40:12,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:40:12,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:40:12,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:40:12,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,907 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-17 20:40:12,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:40:12,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:40:12,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:40:12,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:40:12,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (1/1) ... [2025-03-17 20:40:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:12,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:12,981 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-17 20:40:12,984 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-17 20:40:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:40:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:40:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:40:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:40:13,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:40:13,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:40:14,231 INFO L? ?]: Removed 619 outVars from TransFormulas that were not future-live. [2025-03-17 20:40:14,232 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:40:14,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:40:14,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:40:14,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:40:14 BoogieIcfgContainer [2025-03-17 20:40:14,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:40:14,251 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:40:14,251 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:40:14,255 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:40:14,256 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:40:14,256 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:40:12" (1/3) ... [2025-03-17 20:40:14,257 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d10de29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:40:14, skipping insertion in model container [2025-03-17 20:40:14,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:40:14,257 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:12" (2/3) ... [2025-03-17 20:40:14,257 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d10de29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:40:14, skipping insertion in model container [2025-03-17 20:40:14,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:40:14,257 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:40:14" (3/3) ... [2025-03-17 20:40:14,259 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2025-03-17 20:40:14,309 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:40:14,309 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:40:14,309 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:40:14,309 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:40:14,309 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:40:14,309 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:40:14,309 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:40:14,309 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:40:14,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 436 states, 435 states have (on average 1.7747126436781608) internal successors, (772), 435 states have internal predecessors, (772), 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-17 20:40:14,346 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 422 [2025-03-17 20:40:14,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:14,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:14,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:40:14,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:40:14,353 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:40:14,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 436 states, 435 states have (on average 1.7747126436781608) internal successors, (772), 435 states have internal predecessors, (772), 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-17 20:40:14,364 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 422 [2025-03-17 20:40:14,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:14,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:14,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:40:14,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:40:14,371 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" [2025-03-17 20:40:14,371 INFO L754 eck$LassoCheckResult]: Loop: "assume add_history_type_~var~0#1 < 3;" "assume !(0 == add_history_type_~history_id#1);" "assume !(1 == add_history_type_~history_id#1);" "assume !(2 == add_history_type_~history_id#1);" "assume !(3 == add_history_type_~history_id#1);" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" [2025-03-17 20:40:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1149, now seen corresponding path program 1 times [2025-03-17 20:40:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568863603] [2025-03-17 20:40:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:14,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:40:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:40:14,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:14,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:14,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:14,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:40:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:40:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:14,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash -428500584, now seen corresponding path program 1 times [2025-03-17 20:40:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:14,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631252925] [2025-03-17 20:40:14,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:14,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:14,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:14,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:14,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:14,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:14,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:14,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:14,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:14,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 518476052, now seen corresponding path program 1 times [2025-03-17 20:40:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086980182] [2025-03-17 20:40:14,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:14,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:40:14,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:40:14,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:14,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:14,732 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-17 20:40:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:14,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086980182] [2025-03-17 20:40:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086980182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:14,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:40:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177036242] [2025-03-17 20:40:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:14,775 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:14,776 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:14,776 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:14,776 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:14,776 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:40:14,776 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:14,776 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:14,776 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:14,776 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration1_Loop [2025-03-17 20:40:14,776 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:14,776 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:14,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:14,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:14,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:14,875 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:14,875 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:40:14,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:14,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:14,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:14,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:40:14,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:14,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:14,902 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:14,902 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id#1=7} Honda state: {ULTIMATE.start_add_history_type_~history_id#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:14,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:14,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:14,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:14,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:14,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:40:14,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:14,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:14,926 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:14,926 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Honda state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:14,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:14,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:14,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:14,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:40:14,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:14,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:14,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:14,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:14,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:14,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:40:14,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:40:14,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:14,985 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:40:14,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:14,989 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:14,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:14,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:14,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:14,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:40:14,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:14,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:14,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:14,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration1_Loop [2025-03-17 20:40:14,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:14,990 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:14,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:14,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,089 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:15,092 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:40:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,097 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:40:15,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:15,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:15,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:15,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:15,113 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:40:15,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:15,118 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:40:15,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:15,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:15,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 20:40:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:40:15,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:15,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:15,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:15,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:15,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:15,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:15,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:15,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:15,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:40:15,189 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:40:15,191 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:40:15,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:40:15,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:40:15,199 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:40:15,199 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:40:15,199 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 5 Supporting invariants [] [2025-03-17 20:40:15,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:40:15,208 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:40:15,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:15,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:40:15,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:40:15,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:15,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:15,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:40:15,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:15,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:15,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:15,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:15,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:15,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:40:15,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:15,302 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-17 20:40:15,318 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:40:15,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 436 states, 435 states have (on average 1.7747126436781608) internal successors, (772), 435 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 20:40:15,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 436 states, 435 states have (on average 1.7747126436781608) internal successors, (772), 435 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 925 states and 1636 transitions. Complement of second has 6 states. [2025-03-17 20:40:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:40:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 20:40:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 866 transitions. [2025-03-17 20:40:15,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 866 transitions. Stem has 1 letters. Loop has 6 letters. [2025-03-17 20:40:15,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:15,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 866 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-17 20:40:15,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:15,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 866 transitions. Stem has 1 letters. Loop has 12 letters. [2025-03-17 20:40:15,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:15,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 925 states and 1636 transitions. [2025-03-17 20:40:15,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 370 [2025-03-17 20:40:15,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 925 states to 486 states and 850 transitions. [2025-03-17 20:40:15,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2025-03-17 20:40:15,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2025-03-17 20:40:15,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 486 states and 850 transitions. [2025-03-17 20:40:15,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:15,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 486 states and 850 transitions. [2025-03-17 20:40:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states and 850 transitions. [2025-03-17 20:40:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 485. [2025-03-17 20:40:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 485 states have (on average 1.7505154639175258) internal successors, (849), 484 states have internal predecessors, (849), 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-17 20:40:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 849 transitions. [2025-03-17 20:40:15,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 485 states and 849 transitions. [2025-03-17 20:40:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:15,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:15,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:15,492 INFO L87 Difference]: Start difference. First operand 485 states and 849 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 20:40:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:15,565 INFO L93 Difference]: Finished difference Result 425 states and 705 transitions. [2025-03-17 20:40:15,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 425 states and 705 transitions. [2025-03-17 20:40:15,568 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 379 [2025-03-17 20:40:15,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 425 states to 425 states and 705 transitions. [2025-03-17 20:40:15,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2025-03-17 20:40:15,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2025-03-17 20:40:15,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 425 states and 705 transitions. [2025-03-17 20:40:15,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:15,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 425 states and 705 transitions. [2025-03-17 20:40:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 705 transitions. [2025-03-17 20:40:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2025-03-17 20:40:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 422 states have (on average 1.6635071090047393) internal successors, (702), 421 states have internal predecessors, (702), 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-17 20:40:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 702 transitions. [2025-03-17 20:40:15,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 422 states and 702 transitions. [2025-03-17 20:40:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:15,589 INFO L432 stractBuchiCegarLoop]: Abstraction has 422 states and 702 transitions. [2025-03-17 20:40:15,589 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:40:15,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 422 states and 702 transitions. [2025-03-17 20:40:15,591 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 379 [2025-03-17 20:40:15,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:15,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:15,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:40:15,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:40:15,592 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" [2025-03-17 20:40:15,592 INFO L754 eck$LassoCheckResult]: Loop: "assume add_history_type_~var~0#1 < 3;" "assume !(0 == add_history_type_~history_id#1);" "assume !(1 == add_history_type_~history_id#1);" "assume !(2 == add_history_type_~history_id#1);" "assume !(3 == add_history_type_~history_id#1);" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" [2025-03-17 20:40:15,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 35199955, now seen corresponding path program 1 times [2025-03-17 20:40:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820210219] [2025-03-17 20:40:15,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:15,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:40:15,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:40:15,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:15,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:15,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 20:40:15,666 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-17 20:40:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:15,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820210219] [2025-03-17 20:40:15,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820210219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:15,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:15,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:40:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58350188] [2025-03-17 20:40:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:15,667 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:15,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash -511884776, now seen corresponding path program 1 times [2025-03-17 20:40:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:15,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541987601] [2025-03-17 20:40:15,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:15,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:15,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:15,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:15,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:15,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:15,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:15,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:15,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:15,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:15,714 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:15,714 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:15,714 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:15,714 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:15,714 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:40:15,714 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,714 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:15,714 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:15,714 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration2_Loop [2025-03-17 20:40:15,714 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:15,714 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:15,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,790 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:15,791 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:40:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,793 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:40:15,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:15,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:15,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,816 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:40:15,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:40:15,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:15,841 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:40:15,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 20:40:15,846 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:15,846 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:15,846 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:15,846 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:15,846 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:40:15,846 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,846 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:15,846 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:15,846 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration2_Loop [2025-03-17 20:40:15,846 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:15,846 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:15,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:15,925 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:15,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:40:15,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,927 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:40:15,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:15,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:15,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:15,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:15,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:15,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:15,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:15,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:15,945 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:40:15,948 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:40:15,948 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:40:15,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:15,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:15,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:40:15,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:40:15,954 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:40:15,954 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:40:15,954 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 5 Supporting invariants [] [2025-03-17 20:40:15,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 20:40:15,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:40:15,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:15,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:40:16,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:40:16,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:40:16,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:16,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:40:16,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:16,033 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-17 20:40:16,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:40:16,034 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 422 states and 702 transitions. cyclomatic complexity: 288 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:16,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 422 states and 702 transitions. cyclomatic complexity: 288. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 695 states and 1148 transitions. Complement of second has 5 states. [2025-03-17 20:40:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:40:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-03-17 20:40:16,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 472 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 20:40:16,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:16,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 472 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 20:40:16,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:16,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 472 transitions. Stem has 4 letters. Loop has 12 letters. [2025-03-17 20:40:16,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:16,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 695 states and 1148 transitions. [2025-03-17 20:40:16,077 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 538 [2025-03-17 20:40:16,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 695 states to 692 states and 1139 transitions. [2025-03-17 20:40:16,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2025-03-17 20:40:16,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2025-03-17 20:40:16,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 692 states and 1139 transitions. [2025-03-17 20:40:16,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:16,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 692 states and 1139 transitions. [2025-03-17 20:40:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states and 1139 transitions. [2025-03-17 20:40:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 474. [2025-03-17 20:40:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 474 states have (on average 1.660337552742616) internal successors, (787), 473 states have internal predecessors, (787), 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-17 20:40:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 787 transitions. [2025-03-17 20:40:16,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 474 states and 787 transitions. [2025-03-17 20:40:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:16,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:16,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:16,091 INFO L87 Difference]: Start difference. First operand 474 states and 787 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-17 20:40:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:16,133 INFO L93 Difference]: Finished difference Result 715 states and 1187 transitions. [2025-03-17 20:40:16,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 715 states and 1187 transitions. [2025-03-17 20:40:16,138 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2025-03-17 20:40:16,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 715 states to 715 states and 1187 transitions. [2025-03-17 20:40:16,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2025-03-17 20:40:16,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2025-03-17 20:40:16,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1187 transitions. [2025-03-17 20:40:16,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:16,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1187 transitions. [2025-03-17 20:40:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1187 transitions. [2025-03-17 20:40:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 476. [2025-03-17 20:40:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 476 states have (on average 1.653361344537815) internal successors, (787), 475 states have internal predecessors, (787), 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-17 20:40:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 787 transitions. [2025-03-17 20:40:16,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 476 states and 787 transitions. [2025-03-17 20:40:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:16,150 INFO L432 stractBuchiCegarLoop]: Abstraction has 476 states and 787 transitions. [2025-03-17 20:40:16,150 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:40:16,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 476 states and 787 transitions. [2025-03-17 20:40:16,152 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2025-03-17 20:40:16,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:16,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:16,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:16,153 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-17 20:40:16,154 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume 0 == init_~tmp~1#1;init_#res#1 := 0;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:16,155 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:16,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash 748686802, now seen corresponding path program 1 times [2025-03-17 20:40:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220264648] [2025-03-17 20:40:16,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:16,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:40:16,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:40:16,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,252 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-17 20:40:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220264648] [2025-03-17 20:40:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220264648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:16,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:16,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473796411] [2025-03-17 20:40:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:16,253 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:16,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1716325705, now seen corresponding path program 1 times [2025-03-17 20:40:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812687642] [2025-03-17 20:40:16,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:16,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:40:16,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:40:16,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:16,340 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-17 20:40:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812687642] [2025-03-17 20:40:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812687642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398290613] [2025-03-17 20:40:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:16,341 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:16,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:40:16,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:40:16,342 INFO L87 Difference]: Start difference. First operand 476 states and 787 transitions. cyclomatic complexity: 319 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:16,373 INFO L93 Difference]: Finished difference Result 692 states and 1136 transitions. [2025-03-17 20:40:16,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 1136 transitions. [2025-03-17 20:40:16,377 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2025-03-17 20:40:16,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 690 states and 1131 transitions. [2025-03-17 20:40:16,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 619 [2025-03-17 20:40:16,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 619 [2025-03-17 20:40:16,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 690 states and 1131 transitions. [2025-03-17 20:40:16,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:16,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 690 states and 1131 transitions. [2025-03-17 20:40:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states and 1131 transitions. [2025-03-17 20:40:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 476. [2025-03-17 20:40:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 476 states have (on average 1.6449579831932772) internal successors, (783), 475 states have internal predecessors, (783), 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-17 20:40:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 783 transitions. [2025-03-17 20:40:16,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 476 states and 783 transitions. [2025-03-17 20:40:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:40:16,394 INFO L432 stractBuchiCegarLoop]: Abstraction has 476 states and 783 transitions. [2025-03-17 20:40:16,395 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:40:16,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 476 states and 783 transitions. [2025-03-17 20:40:16,396 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2025-03-17 20:40:16,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:16,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:16,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:16,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:40:16,398 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" [2025-03-17 20:40:16,398 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == add_history_type_~history_id#1);" "assume !(1 == add_history_type_~history_id#1);" "assume !(2 == add_history_type_~history_id#1);" "assume !(3 == add_history_type_~history_id#1);" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" [2025-03-17 20:40:16,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash -951566754, now seen corresponding path program 1 times [2025-03-17 20:40:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:16,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86626085] [2025-03-17 20:40:16,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:16,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:40:16,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:40:16,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,463 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-17 20:40:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86626085] [2025-03-17 20:40:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86626085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:16,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909779370] [2025-03-17 20:40:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:16,464 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -624856438, now seen corresponding path program 1 times [2025-03-17 20:40:16,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:16,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2880825] [2025-03-17 20:40:16,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:16,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:16,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:16,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:16,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:16,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:16,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:16,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:16,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:16,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:16,504 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:16,504 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:16,504 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:16,504 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:16,504 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:40:16,504 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,504 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:16,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:16,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2025-03-17 20:40:16,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:16,504 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:16,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:16,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:16,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:16,573 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:16,573 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:40:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:16,575 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:16,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:40:16,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:16,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:16,589 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:16,590 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Honda state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:16,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:40:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:16,598 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:16,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:40:16,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:16,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:16,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:40:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:16,620 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:16,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:40:16,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:40:16,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:16,675 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:40:16,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:40:16,681 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:16,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:16,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:16,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:16,681 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:40:16,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,681 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:16,681 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:16,681 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2025-03-17 20:40:16,681 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:16,681 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:16,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:16,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:16,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:16,756 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:16,756 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:40:16,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:16,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:16,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:40:16,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:16,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:16,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:16,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:16,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:16,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:16,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:16,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:16,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:16,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 20:40:16,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:16,783 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:16,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:40:16,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:16,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:16,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:16,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:16,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:16,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:16,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:16,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:16,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:40:16,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:40:16,803 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:40:16,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:16,805 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:40:16,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:40:16,809 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:40:16,809 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:40:16,809 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 3 Supporting invariants [] [2025-03-17 20:40:16,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:16,815 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:40:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:40:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:40:16,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:40:16,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:16,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:16,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:40:16,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:16,907 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-17 20:40:16,907 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:40:16,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 476 states and 783 transitions. cyclomatic complexity: 315 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:16,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 476 states and 783 transitions. cyclomatic complexity: 315. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 532 states and 879 transitions. Complement of second has 7 states. [2025-03-17 20:40:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:40:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-17 20:40:16,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 18 letters. Loop has 6 letters. [2025-03-17 20:40:16,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:16,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 24 letters. Loop has 6 letters. [2025-03-17 20:40:16,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:16,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 18 letters. Loop has 12 letters. [2025-03-17 20:40:16,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:16,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 879 transitions. [2025-03-17 20:40:16,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2025-03-17 20:40:16,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 531 states and 875 transitions. [2025-03-17 20:40:16,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2025-03-17 20:40:16,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 405 [2025-03-17 20:40:16,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 875 transitions. [2025-03-17 20:40:16,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:16,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 531 states and 875 transitions. [2025-03-17 20:40:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 875 transitions. [2025-03-17 20:40:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 528. [2025-03-17 20:40:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 528 states have (on average 1.6515151515151516) internal successors, (872), 527 states have internal predecessors, (872), 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-17 20:40:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 872 transitions. [2025-03-17 20:40:16,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 872 transitions. [2025-03-17 20:40:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:16,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:40:16,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:40:16,956 INFO L87 Difference]: Start difference. First operand 528 states and 872 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:16,996 INFO L93 Difference]: Finished difference Result 533 states and 876 transitions. [2025-03-17 20:40:16,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 533 states and 876 transitions. [2025-03-17 20:40:16,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2025-03-17 20:40:17,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 533 states to 517 states and 850 transitions. [2025-03-17 20:40:17,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2025-03-17 20:40:17,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2025-03-17 20:40:17,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 517 states and 850 transitions. [2025-03-17 20:40:17,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:17,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 517 states and 850 transitions. [2025-03-17 20:40:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states and 850 transitions. [2025-03-17 20:40:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 514. [2025-03-17 20:40:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 514 states have (on average 1.6478599221789882) internal successors, (847), 513 states have internal predecessors, (847), 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-17 20:40:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 847 transitions. [2025-03-17 20:40:17,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 514 states and 847 transitions. [2025-03-17 20:40:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:40:17,009 INFO L432 stractBuchiCegarLoop]: Abstraction has 514 states and 847 transitions. [2025-03-17 20:40:17,009 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:40:17,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 514 states and 847 transitions. [2025-03-17 20:40:17,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2025-03-17 20:40:17,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:17,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:17,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:17,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:40:17,013 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" [2025-03-17 20:40:17,013 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == add_history_type_~history_id#1);" "assume !(1 == add_history_type_~history_id#1);" "assume !(2 == add_history_type_~history_id#1);" "assume !(3 == add_history_type_~history_id#1);" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" [2025-03-17 20:40:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1327998221, now seen corresponding path program 1 times [2025-03-17 20:40:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530547899] [2025-03-17 20:40:17,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:17,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:40:17,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:40:17,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:17,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:40:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530547899] [2025-03-17 20:40:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530547899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:40:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690750707] [2025-03-17 20:40:17,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:17,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:40:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,093 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 20:40:17,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:40:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:40:17,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:40:17,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:17,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:40:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690750707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:40:17,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:40:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 20:40:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223954661] [2025-03-17 20:40:17,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:40:17,206 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:17,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash -708240630, now seen corresponding path program 1 times [2025-03-17 20:40:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:17,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230567656] [2025-03-17 20:40:17,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:17,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:17,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:17,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:17,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:17,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:17,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:17,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:17,236 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:17,236 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:17,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:17,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:17,236 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:40:17,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:17,236 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:17,236 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration5_Loop [2025-03-17 20:40:17,236 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:17,236 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:17,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:17,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:17,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:17,314 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:17,314 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:40:17,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,316 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:40:17,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:17,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:17,331 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:17,331 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Honda state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:17,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,339 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 20:40:17,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:17,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:17,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:40:17,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,358 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:40:17,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:40:17,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:17,408 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:40:17,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:17,412 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:17,412 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:17,412 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:17,412 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:17,412 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:40:17,412 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,412 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:17,412 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:17,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration5_Loop [2025-03-17 20:40:17,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:17,412 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:17,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:17,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:17,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:17,487 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:17,487 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:40:17,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,489 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 20:40:17,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:17,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:17,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:17,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:17,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:17,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:17,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:17,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:17,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:17,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:40:17,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,509 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 20:40:17,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:17,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:17,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:17,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:17,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:17,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:17,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:17,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:17,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:40:17,524 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:40:17,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:40:17,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:17,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:17,527 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:17,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:40:17,528 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:40:17,529 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:40:17,529 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:40:17,529 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 3 Supporting invariants [] [2025-03-17 20:40:17,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:17,535 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:40:17,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:17,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:40:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:40:17,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:17,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:40:17,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:17,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:40:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:40:17,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:17,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:40:17,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:17,641 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-17 20:40:17,641 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:40:17,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 514 states and 847 transitions. cyclomatic complexity: 341 Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:17,673 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 514 states and 847 transitions. cyclomatic complexity: 341. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 570 states and 943 transitions. Complement of second has 7 states. [2025-03-17 20:40:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:40:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2025-03-17 20:40:17,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 306 transitions. Stem has 28 letters. Loop has 6 letters. [2025-03-17 20:40:17,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:17,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 306 transitions. Stem has 34 letters. Loop has 6 letters. [2025-03-17 20:40:17,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:17,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 306 transitions. Stem has 28 letters. Loop has 12 letters. [2025-03-17 20:40:17,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:17,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 943 transitions. [2025-03-17 20:40:17,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-03-17 20:40:17,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 569 states and 939 transitions. [2025-03-17 20:40:17,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2025-03-17 20:40:17,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2025-03-17 20:40:17,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 569 states and 939 transitions. [2025-03-17 20:40:17,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:17,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 569 states and 939 transitions. [2025-03-17 20:40:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states and 939 transitions. [2025-03-17 20:40:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2025-03-17 20:40:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 566 states have (on average 1.6537102473498233) internal successors, (936), 565 states have internal predecessors, (936), 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-17 20:40:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 936 transitions. [2025-03-17 20:40:17,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 566 states and 936 transitions. [2025-03-17 20:40:17,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:17,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:40:17,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:40:17,693 INFO L87 Difference]: Start difference. First operand 566 states and 936 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 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-17 20:40:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:17,772 INFO L93 Difference]: Finished difference Result 1237 states and 2047 transitions. [2025-03-17 20:40:17,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1237 states and 2047 transitions. [2025-03-17 20:40:17,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-03-17 20:40:17,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1237 states to 1229 states and 2023 transitions. [2025-03-17 20:40:17,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 691 [2025-03-17 20:40:17,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 691 [2025-03-17 20:40:17,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1229 states and 2023 transitions. [2025-03-17 20:40:17,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:17,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1229 states and 2023 transitions. [2025-03-17 20:40:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states and 2023 transitions. [2025-03-17 20:40:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 915. [2025-03-17 20:40:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 915 states have (on average 1.653551912568306) internal successors, (1513), 914 states have internal predecessors, (1513), 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-17 20:40:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1513 transitions. [2025-03-17 20:40:17,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 915 states and 1513 transitions. [2025-03-17 20:40:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:40:17,806 INFO L432 stractBuchiCegarLoop]: Abstraction has 915 states and 1513 transitions. [2025-03-17 20:40:17,806 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:40:17,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 915 states and 1513 transitions. [2025-03-17 20:40:17,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-03-17 20:40:17,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:17,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:17,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:17,812 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-17 20:40:17,813 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:17,813 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:17,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 1 times [2025-03-17 20:40:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:17,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042396276] [2025-03-17 20:40:17,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:17,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 20:40:17,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 20:40:17,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042396276] [2025-03-17 20:40:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042396276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234844901] [2025-03-17 20:40:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:17,932 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1716325705, now seen corresponding path program 2 times [2025-03-17 20:40:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:17,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453679837] [2025-03-17 20:40:17,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:40:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:17,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:40:17,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:40:17,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:40:17,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:17,993 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-17 20:40:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453679837] [2025-03-17 20:40:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453679837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468634968] [2025-03-17 20:40:17,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:17,994 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:17,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:17,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:17,994 INFO L87 Difference]: Start difference. First operand 915 states and 1513 transitions. cyclomatic complexity: 606 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-17 20:40:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:18,026 INFO L93 Difference]: Finished difference Result 915 states and 1511 transitions. [2025-03-17 20:40:18,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 915 states and 1511 transitions. [2025-03-17 20:40:18,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-03-17 20:40:18,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 915 states to 915 states and 1511 transitions. [2025-03-17 20:40:18,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 483 [2025-03-17 20:40:18,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 483 [2025-03-17 20:40:18,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 915 states and 1511 transitions. [2025-03-17 20:40:18,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:18,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 915 states and 1511 transitions. [2025-03-17 20:40:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states and 1511 transitions. [2025-03-17 20:40:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2025-03-17 20:40:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 915 states have (on average 1.6513661202185792) internal successors, (1511), 914 states have internal predecessors, (1511), 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-17 20:40:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1511 transitions. [2025-03-17 20:40:18,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 915 states and 1511 transitions. [2025-03-17 20:40:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:18,051 INFO L432 stractBuchiCegarLoop]: Abstraction has 915 states and 1511 transitions. [2025-03-17 20:40:18,052 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:40:18,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 915 states and 1511 transitions. [2025-03-17 20:40:18,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-03-17 20:40:18,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:18,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:18,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:18,057 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] [2025-03-17 20:40:18,057 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:18,057 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 2 times [2025-03-17 20:40:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968012634] [2025-03-17 20:40:18,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:40:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-17 20:40:18,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 52 statements. [2025-03-17 20:40:18,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:40:18,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968012634] [2025-03-17 20:40:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968012634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434953344] [2025-03-17 20:40:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,125 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1903039239, now seen corresponding path program 1 times [2025-03-17 20:40:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114203537] [2025-03-17 20:40:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 20:40:18,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:40:18,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:18,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,188 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-17 20:40:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114203537] [2025-03-17 20:40:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114203537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330288774] [2025-03-17 20:40:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,189 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:18,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:18,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:18,189 INFO L87 Difference]: Start difference. First operand 915 states and 1511 transitions. cyclomatic complexity: 604 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:18,218 INFO L93 Difference]: Finished difference Result 913 states and 1507 transitions. [2025-03-17 20:40:18,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 1507 transitions. [2025-03-17 20:40:18,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2025-03-17 20:40:18,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:40:18,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 913 states and 1507 transitions. [2025-03-17 20:40:18,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2025-03-17 20:40:18,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2025-03-17 20:40:18,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 913 states and 1507 transitions. [2025-03-17 20:40:18,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:18,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 913 states and 1507 transitions. [2025-03-17 20:40:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states and 1507 transitions. [2025-03-17 20:40:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2025-03-17 20:40:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 913 states have (on average 1.6506024096385543) internal successors, (1507), 912 states have internal predecessors, (1507), 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-17 20:40:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1507 transitions. [2025-03-17 20:40:18,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 913 states and 1507 transitions. [2025-03-17 20:40:18,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:18,276 INFO L432 stractBuchiCegarLoop]: Abstraction has 913 states and 1507 transitions. [2025-03-17 20:40:18,276 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:40:18,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 913 states and 1507 transitions. [2025-03-17 20:40:18,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2025-03-17 20:40:18,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:18,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:18,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:18,281 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] [2025-03-17 20:40:18,281 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:18,282 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:18,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 3 times [2025-03-17 20:40:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813585812] [2025-03-17 20:40:18,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:40:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-03-17 20:40:18,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 52 statements. [2025-03-17 20:40:18,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:40:18,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813585812] [2025-03-17 20:40:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813585812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054464412] [2025-03-17 20:40:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,358 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2041416686, now seen corresponding path program 1 times [2025-03-17 20:40:18,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078005568] [2025-03-17 20:40:18,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 20:40:18,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 20:40:18,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:18,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,405 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-17 20:40:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078005568] [2025-03-17 20:40:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078005568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170327567] [2025-03-17 20:40:18,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,406 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:18,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:18,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:18,406 INFO L87 Difference]: Start difference. First operand 913 states and 1507 transitions. cyclomatic complexity: 602 Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-17 20:40:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:18,426 INFO L93 Difference]: Finished difference Result 1111 states and 1825 transitions. [2025-03-17 20:40:18,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1111 states and 1825 transitions. [2025-03-17 20:40:18,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 410 [2025-03-17 20:40:18,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1111 states to 1111 states and 1825 transitions. [2025-03-17 20:40:18,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 679 [2025-03-17 20:40:18,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 679 [2025-03-17 20:40:18,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1111 states and 1825 transitions. [2025-03-17 20:40:18,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:18,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1111 states and 1825 transitions. [2025-03-17 20:40:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states and 1825 transitions. [2025-03-17 20:40:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 954. [2025-03-17 20:40:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 954 states have (on average 1.6425576519916143) internal successors, (1567), 953 states have internal predecessors, (1567), 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-17 20:40:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1567 transitions. [2025-03-17 20:40:18,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 954 states and 1567 transitions. [2025-03-17 20:40:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:18,450 INFO L432 stractBuchiCegarLoop]: Abstraction has 954 states and 1567 transitions. [2025-03-17 20:40:18,450 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:40:18,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 954 states and 1567 transitions. [2025-03-17 20:40:18,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 253 [2025-03-17 20:40:18,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:18,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:18,454 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:18,454 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-17 20:40:18,454 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:18,456 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume !(0 == ~gate1Failed~0 % 256);" "assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:18,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 4 times [2025-03-17 20:40:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943133054] [2025-03-17 20:40:18,456 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:40:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,466 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-17 20:40:18,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 52 statements. [2025-03-17 20:40:18,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 20:40:18,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:18,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943133054] [2025-03-17 20:40:18,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943133054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345019573] [2025-03-17 20:40:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,491 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2062938168, now seen corresponding path program 1 times [2025-03-17 20:40:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200865057] [2025-03-17 20:40:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 20:40:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 20:40:18,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,534 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-17 20:40:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200865057] [2025-03-17 20:40:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200865057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103464626] [2025-03-17 20:40:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,535 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:18,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:18,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:18,536 INFO L87 Difference]: Start difference. First operand 954 states and 1567 transitions. cyclomatic complexity: 621 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-17 20:40:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:18,556 INFO L93 Difference]: Finished difference Result 1182 states and 1930 transitions. [2025-03-17 20:40:18,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1182 states and 1930 transitions. [2025-03-17 20:40:18,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 481 [2025-03-17 20:40:18,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1182 states to 1182 states and 1930 transitions. [2025-03-17 20:40:18,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 750 [2025-03-17 20:40:18,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 750 [2025-03-17 20:40:18,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1182 states and 1930 transitions. [2025-03-17 20:40:18,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:18,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1182 states and 1930 transitions. [2025-03-17 20:40:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states and 1930 transitions. [2025-03-17 20:40:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1011. [2025-03-17 20:40:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1011 states have (on average 1.6330365974282888) internal successors, (1651), 1010 states have internal predecessors, (1651), 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-17 20:40:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1651 transitions. [2025-03-17 20:40:18,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1011 states and 1651 transitions. [2025-03-17 20:40:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:18,579 INFO L432 stractBuchiCegarLoop]: Abstraction has 1011 states and 1651 transitions. [2025-03-17 20:40:18,579 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:40:18,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1011 states and 1651 transitions. [2025-03-17 20:40:18,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 310 [2025-03-17 20:40:18,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:18,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:18,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:18,583 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-17 20:40:18,583 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:18,583 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume !(0 == ~gate1Failed~0 % 256);" "assume !(0 == ~gate2Failed~0 % 256);" "assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:18,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 5 times [2025-03-17 20:40:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195541771] [2025-03-17 20:40:18,584 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:40:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 4 equivalence classes. [2025-03-17 20:40:18,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 20:40:18,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 20:40:18,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195541771] [2025-03-17 20:40:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195541771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61849737] [2025-03-17 20:40:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,651 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:18,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 441415957, now seen corresponding path program 1 times [2025-03-17 20:40:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368716301] [2025-03-17 20:40:18,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 20:40:18,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:40:18,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:18,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,681 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-17 20:40:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368716301] [2025-03-17 20:40:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368716301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583556492] [2025-03-17 20:40:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,682 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:18,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:18,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:18,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:18,682 INFO L87 Difference]: Start difference. First operand 1011 states and 1651 transitions. cyclomatic complexity: 648 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-17 20:40:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:18,702 INFO L93 Difference]: Finished difference Result 1281 states and 2080 transitions. [2025-03-17 20:40:18,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1281 states and 2080 transitions. [2025-03-17 20:40:18,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 580 [2025-03-17 20:40:18,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1281 states to 1281 states and 2080 transitions. [2025-03-17 20:40:18,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2025-03-17 20:40:18,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2025-03-17 20:40:18,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1281 states and 2080 transitions. [2025-03-17 20:40:18,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:18,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1281 states and 2080 transitions. [2025-03-17 20:40:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 2080 transitions. [2025-03-17 20:40:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1082. [2025-03-17 20:40:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1082 states have (on average 1.6275415896487986) internal successors, (1761), 1081 states have internal predecessors, (1761), 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-17 20:40:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1761 transitions. [2025-03-17 20:40:18,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1082 states and 1761 transitions. [2025-03-17 20:40:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:18,728 INFO L432 stractBuchiCegarLoop]: Abstraction has 1082 states and 1761 transitions. [2025-03-17 20:40:18,728 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:40:18,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1082 states and 1761 transitions. [2025-03-17 20:40:18,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 381 [2025-03-17 20:40:18,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:18,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:18,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:18,734 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-17 20:40:18,734 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:18,734 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume !(0 == ~gate1Failed~0 % 256);" "assume !(0 == ~gate2Failed~0 % 256);" "assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:18,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,735 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 6 times [2025-03-17 20:40:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824866750] [2025-03-17 20:40:18,735 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:40:18,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,746 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 4 equivalence classes. [2025-03-17 20:40:18,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 52 statements. [2025-03-17 20:40:18,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:40:18,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824866750] [2025-03-17 20:40:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824866750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333080100] [2025-03-17 20:40:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,794 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash 652766870, now seen corresponding path program 1 times [2025-03-17 20:40:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555019182] [2025-03-17 20:40:18,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 20:40:18,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:40:18,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:18,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:18,870 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-17 20:40:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555019182] [2025-03-17 20:40:18,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555019182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:18,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:18,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753697483] [2025-03-17 20:40:18,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:18,870 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:18,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:18,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:40:18,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:40:18,871 INFO L87 Difference]: Start difference. First operand 1082 states and 1761 transitions. cyclomatic complexity: 687 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-17 20:40:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:19,152 INFO L93 Difference]: Finished difference Result 1082 states and 1739 transitions. [2025-03-17 20:40:19,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1739 transitions. [2025-03-17 20:40:19,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 381 [2025-03-17 20:40:19,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1082 states and 1739 transitions. [2025-03-17 20:40:19,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 650 [2025-03-17 20:40:19,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2025-03-17 20:40:19,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1082 states and 1739 transitions. [2025-03-17 20:40:19,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:19,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1082 states and 1739 transitions. [2025-03-17 20:40:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states and 1739 transitions. [2025-03-17 20:40:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1076. [2025-03-17 20:40:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1076 states have (on average 1.6105947955390334) internal successors, (1733), 1075 states have internal predecessors, (1733), 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-17 20:40:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1733 transitions. [2025-03-17 20:40:19,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1076 states and 1733 transitions. [2025-03-17 20:40:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:40:19,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 1076 states and 1733 transitions. [2025-03-17 20:40:19,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:40:19,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1733 transitions. [2025-03-17 20:40:19,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2025-03-17 20:40:19,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:19,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:19,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:19,181 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-17 20:40:19,182 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:19,184 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume !(0 == ~gate1Failed~0 % 256);" "assume !(0 == ~gate2Failed~0 % 256);" "assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume !(0 == read_history_bool_~historyIndex#1);" "assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 7 times [2025-03-17 20:40:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180359486] [2025-03-17 20:40:19,184 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:40:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 20:40:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 20:40:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180359486] [2025-03-17 20:40:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180359486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215118107] [2025-03-17 20:40:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,257 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:19,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1210568338, now seen corresponding path program 1 times [2025-03-17 20:40:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465104081] [2025-03-17 20:40:19,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 20:40:19,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 20:40:19,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:19,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,318 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-17 20:40:19,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465104081] [2025-03-17 20:40:19,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465104081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230286514] [2025-03-17 20:40:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,319 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:19,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:40:19,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:40:19,319 INFO L87 Difference]: Start difference. First operand 1076 states and 1733 transitions. cyclomatic complexity: 665 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-17 20:40:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:19,579 INFO L93 Difference]: Finished difference Result 1083 states and 1721 transitions. [2025-03-17 20:40:19,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1083 states and 1721 transitions. [2025-03-17 20:40:19,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 382 [2025-03-17 20:40:19,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1083 states to 1083 states and 1721 transitions. [2025-03-17 20:40:19,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 651 [2025-03-17 20:40:19,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 651 [2025-03-17 20:40:19,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1083 states and 1721 transitions. [2025-03-17 20:40:19,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:19,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1083 states and 1721 transitions. [2025-03-17 20:40:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states and 1721 transitions. [2025-03-17 20:40:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1076. [2025-03-17 20:40:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1076 states have (on average 1.5929368029739777) internal successors, (1714), 1075 states have internal predecessors, (1714), 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-17 20:40:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2025-03-17 20:40:19,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2025-03-17 20:40:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:40:19,600 INFO L432 stractBuchiCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2025-03-17 20:40:19,600 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:40:19,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1714 transitions. [2025-03-17 20:40:19,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2025-03-17 20:40:19,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:19,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:19,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:19,603 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] [2025-03-17 20:40:19,603 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:19,603 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume !(0 == ~gate1Failed~0 % 256);" "assume !(0 == ~gate2Failed~0 % 256);" "assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume !(0 == read_history_bool_~historyIndex#1);" "assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume !(3 == read_history_int8_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;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;read_history_int8_#res#1 := -2;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:19,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 8 times [2025-03-17 20:40:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881447574] [2025-03-17 20:40:19,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:40:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-17 20:40:19,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 52 statements. [2025-03-17 20:40:19,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:40:19,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881447574] [2025-03-17 20:40:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881447574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964278335] [2025-03-17 20:40:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,649 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -284083780, now seen corresponding path program 1 times [2025-03-17 20:40:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518504640] [2025-03-17 20:40:19,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 20:40:19,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 20:40:19,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:19,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,684 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-17 20:40:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518504640] [2025-03-17 20:40:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518504640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738926210] [2025-03-17 20:40:19,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,685 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:19,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:19,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:19,685 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. cyclomatic complexity: 646 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-17 20:40:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:19,732 INFO L93 Difference]: Finished difference Result 1034 states and 1651 transitions. [2025-03-17 20:40:19,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1034 states and 1651 transitions. [2025-03-17 20:40:19,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 357 [2025-03-17 20:40:19,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1034 states to 1034 states and 1651 transitions. [2025-03-17 20:40:19,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 616 [2025-03-17 20:40:19,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 616 [2025-03-17 20:40:19,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1034 states and 1651 transitions. [2025-03-17 20:40:19,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:19,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1034 states and 1651 transitions. [2025-03-17 20:40:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states and 1651 transitions. [2025-03-17 20:40:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-17 20:40:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1034 states have (on average 1.5967117988394584) internal successors, (1651), 1033 states have internal predecessors, (1651), 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-17 20:40:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1651 transitions. [2025-03-17 20:40:19,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1034 states and 1651 transitions. [2025-03-17 20:40:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:19,752 INFO L432 stractBuchiCegarLoop]: Abstraction has 1034 states and 1651 transitions. [2025-03-17 20:40:19,752 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:40:19,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1034 states and 1651 transitions. [2025-03-17 20:40:19,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 357 [2025-03-17 20:40:19,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:19,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:19,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:19,754 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] [2025-03-17 20:40:19,754 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:19,755 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume !(0 == ~gate1Failed~0 % 256);" "assume !(0 == ~gate2Failed~0 % 256);" "assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume !(0 == read_history_bool_~historyIndex#1);" "assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume !(0 == read_history_int8_~historyIndex#1);" "assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:19,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 9 times [2025-03-17 20:40:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845468854] [2025-03-17 20:40:19,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:40:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-03-17 20:40:19,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 52 statements. [2025-03-17 20:40:19,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:40:19,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845468854] [2025-03-17 20:40:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845468854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:40:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944668386] [2025-03-17 20:40:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,824 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1071177855, now seen corresponding path program 1 times [2025-03-17 20:40:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272721598] [2025-03-17 20:40:19,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 20:40:19,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 20:40:19,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:19,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,878 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-17 20:40:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272721598] [2025-03-17 20:40:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272721598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297201577] [2025-03-17 20:40:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,879 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:19,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:19,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:19,879 INFO L87 Difference]: Start difference. First operand 1034 states and 1651 transitions. cyclomatic complexity: 625 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-17 20:40:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:19,890 INFO L93 Difference]: Finished difference Result 1035 states and 1651 transitions. [2025-03-17 20:40:19,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1035 states and 1651 transitions. [2025-03-17 20:40:19,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 338 [2025-03-17 20:40:19,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1035 states to 1015 states and 1619 transitions. [2025-03-17 20:40:19,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 597 [2025-03-17 20:40:19,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 597 [2025-03-17 20:40:19,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1619 transitions. [2025-03-17 20:40:19,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:40:19,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1619 transitions. [2025-03-17 20:40:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1619 transitions. [2025-03-17 20:40:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2025-03-17 20:40:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1015 states have (on average 1.5950738916256157) internal successors, (1619), 1014 states have internal predecessors, (1619), 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-17 20:40:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1619 transitions. [2025-03-17 20:40:19,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1619 transitions. [2025-03-17 20:40:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:19,909 INFO L432 stractBuchiCegarLoop]: Abstraction has 1015 states and 1619 transitions. [2025-03-17 20:40:19,909 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:40:19,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1015 states and 1619 transitions. [2025-03-17 20:40:19,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 338 [2025-03-17 20:40:19,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:19,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:19,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:19,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:19,912 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));" "add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1;" "assume !(add_history_type_~var~0#1 < 3);add_history_type_#res#1 := 1;" "init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1;" "assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1;" "assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1;" "assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0;" "assume add_history_type_~var~0#1 < 3;" "assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);" "add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1;" "assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0;" "init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1;" "assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1;" "main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1;" "assume !(0 == main_~i2~0#1);" "~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:19,912 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 10;assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume !(0 != ~gate1Failed~0 % 256);havoc gate1_each_pals_period_#t~nondet32#1;gate1_each_pals_period_~tmp~3#1 := gate1_each_pals_period_#t~nondet32#1;havoc gate1_each_pals_period_#t~nondet32#1;gate1_each_pals_period_~next_state~0#1 := gate1_each_pals_period_~tmp~3#1;" "assume 0 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1;" "assume !(0 == (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256);" "~g1v_new~0 := (if (if gate1_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then gate1_each_pals_period_~next_state~0#1 else ~g1v_new~0) % 256 <= 127 then (if gate1_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then gate1_each_pals_period_~next_state~0#1 else ~g1v_new~0) % 256 else (if gate1_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then gate1_each_pals_period_~next_state~0#1 else ~g1v_new~0) % 256 - 256);" "havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256);" "havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1;" "assume !(0 == write_history_bool_~history_id#1);" "assume !(1 == write_history_bool_~history_id#1);" "assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1);" "havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true;" "assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256);" "havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0;" "assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0;" "assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1;" "assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1;" "havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true;havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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;" "assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1;" "assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256);" "assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1;" "assume 0 == read_history_bool_~history_id#1;" "assume !(0 == read_history_bool_~historyIndex#1);" "assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1;" "assume !(0 == check_~tmp___3~0#1 % 256);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume !(0 == read_history_int8_~historyIndex#1);" "assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0;" "check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1;" "assume !(check_~tmp___10~0#1 > -2);" "assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1;" "assume 3 == read_history_int8_~history_id#1;" "assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0;" "check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1;" "assume !(check_~tmp___11~0#1 != ~nomsg~0);" "check_#res#1 := 1;" "main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1;" [2025-03-17 20:40:19,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 68548281, now seen corresponding path program 10 times [2025-03-17 20:40:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906403221] [2025-03-17 20:40:19,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:40:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-17 20:40:19,922 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 52 statements. [2025-03-17 20:40:19,922 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 20:40:19,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 20:40:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906403221] [2025-03-17 20:40:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906403221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622845675] [2025-03-17 20:40:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:19,935 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:19,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -871388360, now seen corresponding path program 1 times [2025-03-17 20:40:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419175018] [2025-03-17 20:40:19,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:19,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 20:40:19,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 20:40:19,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:19,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:19,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:19,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 20:40:19,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 20:40:19,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:19,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:20,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:22,204 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:22,205 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:22,205 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:22,205 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:22,205 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:40:22,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:22,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:22,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:22,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration15_Loop [2025-03-17 20:40:22,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:22,205 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:22,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:22,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:23,093 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-03-17 20:40:29,130 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 343 DAG size of output: 123 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-03-17 20:40:29,381 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:29,381 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:40:29,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,383 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:40:29,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,397 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,397 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33#1=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,404 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:40:29,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,416 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,416 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2#1=0} Honda state: {ULTIMATE.start_check_~tmp~2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:40:29,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,423 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:40:29,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,435 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,435 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0#1=0} Honda state: {ULTIMATE.start_check_~tmp___8~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:40:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,442 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:40:29,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,443 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,453 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,453 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0#1=0} Honda state: {ULTIMATE.start_check_~tmp___4~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 20:40:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,461 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:40:29,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,484 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,484 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___0~2#1=0} Honda state: {ULTIMATE.start_check_~tmp___0~2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:29,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,493 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:40:29,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,507 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,507 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_#res#1=0} Honda state: {ULTIMATE.start_read_history_bool_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:40:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,514 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 20:40:29,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,526 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,526 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_voter_~voted_value~0#1=0} Honda state: {ULTIMATE.start_voter_~voted_value~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 20:40:29,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,533 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:40:29,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,545 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,545 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#res#1=0} Honda state: {ULTIMATE.start_read_history_int8_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:40:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,553 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:40:29,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,565 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,565 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_~arg#1=0} Honda state: {ULTIMATE.start_assert_~arg#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 20:40:29,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,572 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 20:40:29,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,584 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,584 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0#1=0} Honda state: {ULTIMATE.start_check_~tmp___13~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:40:29,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,592 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 20:40:29,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,604 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,604 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex#1=0} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 20:40:29,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,611 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:29,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 20:40:29,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,625 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,625 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22#1=0} Honda state: {ULTIMATE.start_check_#t~ret22#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 20:40:29,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,632 INFO L229 MonitoredProcess]: Starting monitored process 38 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-17 20:40:29,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 20:40:29,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,644 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,644 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_#in~buf#1=0} Honda state: {ULTIMATE.start_write_history_int8_#in~buf#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 20:40:29,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,651 INFO L229 MonitoredProcess]: Starting monitored process 39 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-17 20:40:29,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 20:40:29,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,663 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,663 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4#1=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 20:40:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,671 INFO L229 MonitoredProcess]: Starting monitored process 40 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-17 20:40:29,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 20:40:29,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,684 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,685 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id#1=0} Honda state: {ULTIMATE.start_read_history_int8_~history_id#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-17 20:40:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,693 INFO L229 MonitoredProcess]: Starting monitored process 41 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-17 20:40:29,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 20:40:29,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,705 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,705 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_#in~history_id#1=0} Honda state: {ULTIMATE.start_read_history_bool_#in~history_id#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-17 20:40:29,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,712 INFO L229 MonitoredProcess]: Starting monitored process 42 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-17 20:40:29,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 20:40:29,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,725 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,725 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret56#1=0} Honda state: {ULTIMATE.start_main_#t~ret56#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-17 20:40:29,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,732 INFO L229 MonitoredProcess]: Starting monitored process 43 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-17 20:40:29,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 20:40:29,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,744 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,744 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret13#1=0} Honda state: {ULTIMATE.start_check_#t~ret13#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 20:40:29,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,752 INFO L229 MonitoredProcess]: Starting monitored process 44 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-17 20:40:29,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 20:40:29,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,764 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,764 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3#1=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 20:40:29,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,771 INFO L229 MonitoredProcess]: Starting monitored process 45 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-17 20:40:29,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 20:40:29,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,784 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,784 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~buf#1=0} Honda state: {ULTIMATE.start_write_history_int8_~buf#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:29,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,791 INFO L229 MonitoredProcess]: Starting monitored process 46 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-17 20:40:29,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 20:40:29,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,802 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,802 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0#1=0} Honda state: {ULTIMATE.start_check_~temp_count~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 20:40:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,809 INFO L229 MonitoredProcess]: Starting monitored process 47 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-17 20:40:29,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 20:40:29,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,821 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,821 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2#1=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,828 INFO L229 MonitoredProcess]: Starting monitored process 48 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-17 20:40:29,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 20:40:29,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,840 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,840 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___10~0#1=0} Honda state: {ULTIMATE.start_check_~tmp___10~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 20:40:29,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,847 INFO L229 MonitoredProcess]: Starting monitored process 49 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-17 20:40:29,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 20:40:29,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,859 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,859 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post57#1=0} Honda state: {ULTIMATE.start_main_#t~post57#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 20:40:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,866 INFO L229 MonitoredProcess]: Starting monitored process 50 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-17 20:40:29,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 20:40:29,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,879 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,879 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret27#1=0} Honda state: {ULTIMATE.start_check_#t~ret27#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:29,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,885 INFO L229 MonitoredProcess]: Starting monitored process 51 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-17 20:40:29,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 20:40:29,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,897 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,897 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0#1=0} Honda state: {ULTIMATE.start_check_~tmp___7~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:40:29,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,904 INFO L229 MonitoredProcess]: Starting monitored process 52 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-17 20:40:29,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 20:40:29,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,916 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,917 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=0} Honda state: {~gate1Failed~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:29,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,923 INFO L229 MonitoredProcess]: Starting monitored process 53 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-17 20:40:29,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 20:40:29,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,935 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,935 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret14#1=0} Honda state: {ULTIMATE.start_check_#t~ret14#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 20:40:29,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,942 INFO L229 MonitoredProcess]: Starting monitored process 54 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-17 20:40:29,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 20:40:29,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,954 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,954 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~next_state~1#1=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~next_state~1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 20:40:29,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,961 INFO L229 MonitoredProcess]: Starting monitored process 55 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-17 20:40:29,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 20:40:29,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,974 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,974 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~next_state~0#1=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~next_state~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-17 20:40:29,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:29,981 INFO L229 MonitoredProcess]: Starting monitored process 56 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-17 20:40:29,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 20:40:29,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:29,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:29,993 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:29,993 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp~3#1=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp~3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:29,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 20:40:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:29,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:30,000 INFO L229 MonitoredProcess]: Starting monitored process 57 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-17 20:40:30,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 20:40:30,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:30,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:30,013 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:30,013 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~history_id#1=0} Honda state: {ULTIMATE.start_read_history_bool_~history_id#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:30,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:40:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:30,020 INFO L229 MonitoredProcess]: Starting monitored process 58 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-17 20:40:30,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 20:40:30,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:30,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:30,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 20:40:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:30,039 INFO L229 MonitoredProcess]: Starting monitored process 59 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-17 20:40:30,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 20:40:30,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:40:30,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:30,063 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:40:30,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 20:40:30,067 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:30,067 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:30,067 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:30,067 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:30,067 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:40:30,067 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:30,067 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:30,067 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:30,067 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration15_Loop [2025-03-17 20:40:30,067 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:30,067 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:30,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:30,857 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-03-17 20:40:36,054 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 343 DAG size of output: 123 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-03-17 20:40:36,547 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:36,548 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:40:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,550 INFO L229 MonitoredProcess]: Starting monitored process 60 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-17 20:40:36,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 20:40:36,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 20:40:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,578 INFO L229 MonitoredProcess]: Starting monitored process 61 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-17 20:40:36,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 20:40:36,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:36,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,602 INFO L229 MonitoredProcess]: Starting monitored process 62 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-17 20:40:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 20:40:36,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:36,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,626 INFO L229 MonitoredProcess]: Starting monitored process 63 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-17 20:40:36,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 20:40:36,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:36,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,647 INFO L229 MonitoredProcess]: Starting monitored process 64 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-17 20:40:36,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 20:40:36,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 20:40:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,682 INFO L229 MonitoredProcess]: Starting monitored process 65 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-17 20:40:36,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 20:40:36,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:36,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,707 INFO L229 MonitoredProcess]: Starting monitored process 66 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-17 20:40:36,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 20:40:36,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,730 INFO L229 MonitoredProcess]: Starting monitored process 67 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-17 20:40:36,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 20:40:36,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 20:40:36,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,753 INFO L229 MonitoredProcess]: Starting monitored process 68 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-17 20:40:36,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 20:40:36,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:40:36,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,773 INFO L229 MonitoredProcess]: Starting monitored process 69 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-17 20:40:36,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 20:40:36,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:36,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,792 INFO L229 MonitoredProcess]: Starting monitored process 70 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-17 20:40:36,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 20:40:36,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:36,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:36,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-17 20:40:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:36,812 INFO L229 MonitoredProcess]: Starting monitored process 71 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-17 20:40:36,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 20:40:36,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:36,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:36,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:36,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:36,824 INFO L204 nArgumentSynthesizer]: 20 loop disjuncts [2025-03-17 20:40:36,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:36,905 INFO L401 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2025-03-17 20:40:36,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:36,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:36,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 20:40:36,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:36,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,000 INFO L229 MonitoredProcess]: Starting monitored process 72 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-17 20:40:37,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 20:40:37,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 20:40:37,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,018 INFO L229 MonitoredProcess]: Starting monitored process 73 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-17 20:40:37,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 20:40:37,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 20:40:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,038 INFO L229 MonitoredProcess]: Starting monitored process 74 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-17 20:40:37,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 20:40:37,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:40:37,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,058 INFO L229 MonitoredProcess]: Starting monitored process 75 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-17 20:40:37,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 20:40:37,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 20:40:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,080 INFO L229 MonitoredProcess]: Starting monitored process 76 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-17 20:40:37,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 20:40:37,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-17 20:40:37,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,098 INFO L229 MonitoredProcess]: Starting monitored process 77 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-17 20:40:37,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 20:40:37,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 20:40:37,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,117 INFO L229 MonitoredProcess]: Starting monitored process 78 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-17 20:40:37,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-17 20:40:37,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-17 20:40:37,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,136 INFO L229 MonitoredProcess]: Starting monitored process 79 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-17 20:40:37,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 20:40:37,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,156 INFO L229 MonitoredProcess]: Starting monitored process 80 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-17 20:40:37,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-17 20:40:37,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-17 20:40:37,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,175 INFO L229 MonitoredProcess]: Starting monitored process 81 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-17 20:40:37,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-17 20:40:37,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-17 20:40:37,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,194 INFO L229 MonitoredProcess]: Starting monitored process 82 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-17 20:40:37,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-17 20:40:37,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 20:40:37,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,212 INFO L229 MonitoredProcess]: Starting monitored process 83 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-17 20:40:37,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 20:40:37,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 20:40:37,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,232 INFO L229 MonitoredProcess]: Starting monitored process 84 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-17 20:40:37,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-17 20:40:37,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-17 20:40:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,251 INFO L229 MonitoredProcess]: Starting monitored process 85 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-17 20:40:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-17 20:40:37,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-17 20:40:37,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,270 INFO L229 MonitoredProcess]: Starting monitored process 86 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-17 20:40:37,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-17 20:40:37,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-17 20:40:37,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,291 INFO L229 MonitoredProcess]: Starting monitored process 87 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-17 20:40:37,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-17 20:40:37,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-17 20:40:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,309 INFO L229 MonitoredProcess]: Starting monitored process 88 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-17 20:40:37,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-17 20:40:37,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-17 20:40:37,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,328 INFO L229 MonitoredProcess]: Starting monitored process 89 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-17 20:40:37,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-17 20:40:37,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-17 20:40:37,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,348 INFO L229 MonitoredProcess]: Starting monitored process 90 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-17 20:40:37,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-17 20:40:37,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,369 INFO L229 MonitoredProcess]: Starting monitored process 91 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-17 20:40:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-17 20:40:37,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-17 20:40:37,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,389 INFO L229 MonitoredProcess]: Starting monitored process 92 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-17 20:40:37,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-17 20:40:37,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-17 20:40:37,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,409 INFO L229 MonitoredProcess]: Starting monitored process 93 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-17 20:40:37,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-17 20:40:37,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-17 20:40:37,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,431 INFO L229 MonitoredProcess]: Starting monitored process 94 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-17 20:40:37,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-17 20:40:37,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:40:37,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-17 20:40:37,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,450 INFO L229 MonitoredProcess]: Starting monitored process 95 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-17 20:40:37,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-17 20:40:37,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:40:37,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:40:37,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:40:37,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:40:37,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:40:37,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:40:37,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:40:37,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:40:37,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:40:37,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:40:37,468 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:40:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:37,470 INFO L229 MonitoredProcess]: Starting monitored process 96 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-17 20:40:37,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-17 20:40:37,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:40:37,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:40:37,474 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:40:37,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2025-03-17 20:40:37,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:37,480 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:40:37,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:37,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 20:40:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 20:40:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:37,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:40:37,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:37,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 20:40:37,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 20:40:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:37,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:40:37,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:40:37,745 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-17 20:40:37,745 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:40:37,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1015 states and 1619 transitions. cyclomatic complexity: 612 Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:37,769 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1015 states and 1619 transitions. cyclomatic complexity: 612. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1353 states and 2110 transitions. Complement of second has 4 states. [2025-03-17 20:40:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:40:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2025-03-17 20:40:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 574 transitions. Stem has 52 letters. Loop has 46 letters. [2025-03-17 20:40:37,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 574 transitions. Stem has 98 letters. Loop has 46 letters. [2025-03-17 20:40:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:37,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 574 transitions. Stem has 52 letters. Loop has 92 letters. [2025-03-17 20:40:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:40:37,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1353 states and 2110 transitions. [2025-03-17 20:40:37,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:40:37,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1353 states to 0 states and 0 transitions. [2025-03-17 20:40:37,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:40:37,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:40:37,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:40:37,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:40:37,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:40:37,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:40:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:37,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:37,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:37,779 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. 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-17 20:40:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:37,779 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-17 20:40:37,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-17 20:40:37,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:40:37,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 20:40:37,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:40:37,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:40:37,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:40:37,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:40:37,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:40:37,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:40:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:40:37,780 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:40:37,780 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 20:40:37,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:40:37,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:40:37,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:40:37,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:40:37 BoogieIcfgContainer [2025-03-17 20:40:37,786 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:40:37,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:40:37,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:40:37,787 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:40:37,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:40:14" (3/4) ... [2025-03-17 20:40:37,789 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:40:37,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:40:37,790 INFO L158 Benchmark]: Toolchain (without parser) took 25231.47ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 123.6MB in the beginning and 255.3MB in the end (delta: -131.7MB). Peak memory consumption was 242.1MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,790 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:40:37,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.02ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 107.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.35ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 100.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,790 INFO L158 Benchmark]: Boogie Preprocessor took 80.27ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 92.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,791 INFO L158 Benchmark]: IcfgBuilder took 1304.84ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,791 INFO L158 Benchmark]: BuchiAutomizer took 23534.75ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 76.1MB in the beginning and 255.4MB in the end (delta: -179.3MB). Peak memory consumption was 182.3MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,792 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 536.9MB. Free memory was 255.4MB in the beginning and 255.3MB in the end (delta: 70.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:40:37,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.02ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 107.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.35ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 100.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.27ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 92.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1304.84ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 23534.75ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 76.1MB in the beginning and 255.4MB in the end (delta: -179.3MB). Peak memory consumption was 182.3MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 536.9MB. Free memory was 255.4MB in the beginning and 255.3MB in the end (delta: 70.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (15 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (5 + ((long long) -2 * var)) and consists of 4 locations. One deterministic module has affine ranking function (5 + ((long long) -2 * var)) and consists of 3 locations. One deterministic module has affine ranking function (3 + ((long long) -2 * var)) and consists of 4 locations. One deterministic module has affine ranking function (3 + ((long long) -2 * var)) and consists of 4 locations. One deterministic module has affine ranking function (19 + ((long long) -2 * i2)) and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.4s and 16 iterations. TraceHistogramMax:3. Analysis of lassos took 21.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 18. Automata minimization 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1538 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4426 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4421 mSDsluCounter, 22733 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12254 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1045 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 10479 mSDtfsCounter, 1045 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI10 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital73 mio100 ax100 hnf100 lsp75 ukn89 mio100 lsp100 div114 bol100 ite100 ukn100 eq183 hnf99 smp94 dnf3840 smp7 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 179ms VariablesStem: 0 VariablesLoop: 27 DisjunctsStem: 1 DisjunctsLoop: 20 SupportingInvariants: 0 MotzkinApplications: 40 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 36 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:40:37,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:38,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:38,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE