./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:52:36,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:52:36,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:52:36,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:52:36,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:52:36,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:52:36,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:52:36,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:52:36,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:52:36,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:52:36,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:52:36,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:52:36,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:52:36,305 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:52:36,306 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:52:36,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:52:36,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:52:36,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:52:36,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:52:36,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:52:36,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:52:36,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:52:36,307 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:52:36,307 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-jdk21/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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2025-02-08 14:52:36,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:52:36,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:52:36,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:52:36,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:52:36,542 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:52:36,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-02-08 14:52:37,694 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee62a3744/a5c40b4f6df9460696768184478e46af/FLAGfb56e4e45 [2025-02-08 14:52:38,000 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:52:38,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-02-08 14:52:38,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee62a3744/a5c40b4f6df9460696768184478e46af/FLAGfb56e4e45 [2025-02-08 14:52:38,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee62a3744/a5c40b4f6df9460696768184478e46af [2025-02-08 14:52:38,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:52:38,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:52:38,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:52:38,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:52:38,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:52:38,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcd15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38, skipping insertion in model container [2025-02-08 14:52:38,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:52:38,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:52:38,224 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:52:38,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:52:38,283 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:52:38,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38 WrapperNode [2025-02-08 14:52:38,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:52:38,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:52:38,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:52:38,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:52:38,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,343 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 47, calls inlined = 126, statements flattened = 1615 [2025-02-08 14:52:38,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:52:38,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:52:38,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:52:38,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:52:38,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,373 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-02-08 14:52:38,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:52:38,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:52:38,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:52:38,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:52:38,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (1/1) ... [2025-02-08 14:52:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:38,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:38,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:38,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:52:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:52:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:52:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:52:38,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:52:38,516 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:52:38,517 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:52:39,397 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 14:52:39,397 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: assume !(~VALUE2~0 != ~nomsg~0); [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume 0 == check_~tmp___4~0#1 % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 2, 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; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume !(0 == check_~tmp___4~0#1 % 256); [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: check_#t~ret15#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___5~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: 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; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume !(3 == write_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; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1;assume false; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume 0 == assume_abort_if_not_~cond#1;assume false; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1;assume false; [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:52:39,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume 0 == assume_abort_if_not_~cond#1;assume false; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume 0 == check_~tmp___5~0#1 % 256;check_~temp_count~0#1 := 0;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; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume !(0 == check_~tmp___5~0#1 % 256); [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: assume ~VALUE3~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: assume !(~VALUE3~0 != ~nomsg~0);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L336-1: check_#res#1 := 1; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: 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; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303-1: 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; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-1: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-1: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-2: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-2: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-3: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-3: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-4: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-4: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-5: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-5: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-6: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-6: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-7: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-7: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: 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; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: assume !(check_~tmp___10~0#1 > -2); [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-8: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-8: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: check_#t~ret16#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___0~2#1 := check_#t~ret16#1;havoc check_#t~ret16#1; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-9: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-9: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-10: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-10: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-11: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-11: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: assume 1 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: assume !(1 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-12: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-12: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-1: assume 1 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-1: assume !(1 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-13: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-13: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-2: assume 1 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-2: assume !(1 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-14: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-14: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-3: assume 1 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-3: assume !(1 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-15: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-15: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-4: assume 1 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-4: assume !(1 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-16: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-16: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-5: assume 1 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139-5: assume !(1 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-17: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-17: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-18: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-18: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-19: assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:52:39,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-19: assume !(0 == assert_~arg#1 % 256); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: check_#t~ret23#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___6~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1; [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: assume ~VALUE1~0 == check_~tmp___0~2#1;check_#t~post17#1 := check_~temp_count~0#1;check_~temp_count~0#1 := 1 + check_#t~post17#1;havoc check_#t~post17#1; [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: assume !(~VALUE1~0 == check_~tmp___0~2#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-1: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-1: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-2: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-2: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-3: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-3: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-4: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-4: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-5: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L140-5: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: assume check_~tmp___6~0#1 == ~nomsg~0;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; [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: assume !(check_~tmp___6~0#1 == ~nomsg~0); [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L174: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; [2025-02-08 14:52:39,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: check_#t~ret24#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___7~0#1 := (if 0 == check_#t~ret24#1 % 256 then 0 else 1);havoc check_#t~ret24#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L76-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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L76-2: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L76-3: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: 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; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume 3 == read_history_int8_~history_id#1; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L473: 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L473-1: 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 1, 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: assume !(0 != check_~tmp___7~0#1 % 256);check_#res#1 := 0; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: check_#t~ret18#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___1~2#1 := check_#t~ret18#1;havoc check_#t~ret18#1; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L275-1: 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; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-1: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-1: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-2: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-2: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77: 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; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77: 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)); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-3: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-3: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-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; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-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)); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-4: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-4: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-2: 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; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-2: 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)); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-4: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-4: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-5: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143-5: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate2Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-3: 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; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77-3: 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)); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume !(0 == read_history_int8_~historyIndex#1); [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: check_#t~ret25#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___8~0#1 := (if 0 == check_#t~ret25#1 % 256 then 0 else 1);havoc check_#t~ret25#1; [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: assume ~VALUE2~0 == check_~tmp___1~2#1;check_#t~post19#1 := check_~temp_count~0#1;check_~temp_count~0#1 := 1 + check_#t~post19#1;havoc check_#t~post19#1; [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: assume !(~VALUE2~0 == check_~tmp___1~2#1); [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L409: 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; [2025-02-08 14:52:39,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: assume 0 != check_~tmp___8~0#1 % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 2, 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; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: assume !(0 != check_~tmp___8~0#1 % 256);check_#res#1 := 0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: 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); [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: assume !(0 != ~gate3Failed~0 % 256);havoc gate3_each_pals_period_#t~nondet36#1;gate3_each_pals_period_~tmp~5#1 := gate3_each_pals_period_#t~nondet36#1;havoc gate3_each_pals_period_#t~nondet36#1;gate3_each_pals_period_~next_state~2#1 := gate3_each_pals_period_~tmp~5#1; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: check_#t~ret26#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___9~0#1 := (if 0 == check_#t~ret26#1 % 256 then 0 else 1);havoc check_#t~ret26#1; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-3: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-3: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-4: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-4: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-5: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-5: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-6: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-6: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,409 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-7: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-7: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-8: assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-8: assume !(1 == read_history_int8_~historyIndex#1);read_history_int8_#res#1 := ~votedValue_History_2~0; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: assume !(~VALUE1~0 == ~VALUE2~0); [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: 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; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume 0 == check_~tmp___9~0#1 % 256;check_#res#1 := 0; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume !(0 == check_~tmp___9~0#1 % 256); [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: check_#t~ret20#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___2~2#1 := check_#t~ret20#1;havoc check_#t~ret20#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: 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; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: 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); [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: assume !(0 != ~gate2Failed~0 % 256);havoc gate2_each_pals_period_#t~nondet34#1;gate2_each_pals_period_~tmp~4#1 := gate2_each_pals_period_#t~nondet34#1;havoc gate2_each_pals_period_#t~nondet34#1;gate2_each_pals_period_~next_state~1#1 := gate2_each_pals_period_~tmp~4#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume ~VALUE3~0 == check_~tmp___2~2#1;check_#t~post21#1 := check_~temp_count~0#1;check_~temp_count~0#1 := 1 + check_#t~post21#1;havoc check_#t~post21#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume !(~VALUE3~0 == check_~tmp___2~2#1); [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: add_history_type_#t~ret5#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~0#1 := (if add_history_type_#t~ret5#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret5#1 % 256 % 4294967296 else add_history_type_#t~ret5#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret5#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-1: add_history_type_#t~ret5#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~0#1 := (if add_history_type_#t~ret5#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret5#1 % 256 % 4294967296 else add_history_type_#t~ret5#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret5#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-2: add_history_type_#t~ret5#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~0#1 := (if add_history_type_#t~ret5#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret5#1 % 256 % 4294967296 else add_history_type_#t~ret5#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret5#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-3: add_history_type_#t~ret5#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~0#1 := (if add_history_type_#t~ret5#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret5#1 % 256 % 4294967296 else add_history_type_#t~ret5#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret5#1; [2025-02-08 14:52:39,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L347: 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; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149: assume 2 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149: assume !(2 == read_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-1: assume 2 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-1: assume !(2 == read_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-2: assume 2 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-2: assume !(2 == read_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: assume !(add_history_type_~tmp___0~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; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: assume !!(add_history_type_~tmp___0~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)); [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-3: assume 2 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-3: assume !(2 == read_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: assume !(add_history_type_~tmp___0~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; [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: assume !!(add_history_type_~tmp___0~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)); [2025-02-08 14:52:39,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-4: assume 2 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-4: assume !(2 == read_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-2: assume !(add_history_type_~tmp___0~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; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-2: assume !!(add_history_type_~tmp___0~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)); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-5: assume 2 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-5: assume !(2 == read_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-3: assume !(add_history_type_~tmp___0~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; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-3: assume !!(add_history_type_~tmp___0~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)); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: 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; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: assume ~VALUE1~0 == ~VALUE3~0; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: assume !(~VALUE1~0 == ~VALUE3~0); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: 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); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: 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; [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-1: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-1: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-2: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-2: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-3: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-3: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-4: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-4: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-5: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-5: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: 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; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume ~VALUE1~0 != ~VALUE2~0; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume !(~VALUE1~0 != ~VALUE2~0); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: 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); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: assume !(0 == write_history_bool_~history_id#1); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184-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); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184-1: assume !(0 == write_history_bool_~history_id#1); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: 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; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume 0 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(0 == gate3_each_pals_period_~next_state~2#1); [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume ~VALUE1~0 != ~VALUE3~0; [2025-02-08 14:52:39,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume !(~VALUE1~0 != ~VALUE3~0); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-1: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-6: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-7: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-8: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516: 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; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume ~VALUE2~0 != ~VALUE3~0; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume !(~VALUE2~0 != ~VALUE3~0); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume !(0 == ~gate1Failed~0 % 256); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-1: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-1: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-2: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-2: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-3: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-3: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-4: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-4: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-5: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-5: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate3Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume 0 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume !(0 == gate2_each_pals_period_~next_state~1#1); [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: assume !(1 == check_~temp_count~0#1);check_#res#1 := 0; [2025-02-08 14:52:39,414 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: assume !!(1 == check_~temp_count~0#1); [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: add_history_type_#t~ret6#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___1~0#1 := (if add_history_type_#t~ret6#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret6#1 % 256 % 4294967296 else add_history_type_#t~ret6#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret6#1; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88-1: add_history_type_#t~ret6#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___1~0#1 := (if add_history_type_#t~ret6#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret6#1 % 256 % 4294967296 else add_history_type_#t~ret6#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret6#1; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88-2: add_history_type_#t~ret6#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___1~0#1 := (if add_history_type_#t~ret6#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret6#1 % 256 % 4294967296 else add_history_type_#t~ret6#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret6#1; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88-3: add_history_type_#t~ret6#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___1~0#1 := (if add_history_type_#t~ret6#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret6#1 % 256 % 4294967296 else add_history_type_#t~ret6#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret6#1; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume 1 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume !(1 == gate3_each_pals_period_~next_state~2#1); [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: assume !(add_history_type_~tmp___1~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; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: assume !!(add_history_type_~tmp___1~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)); [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-1: assume !(add_history_type_~tmp___1~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; [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-1: assume !!(add_history_type_~tmp___1~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)); [2025-02-08 14:52:39,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-2: assume !(add_history_type_~tmp___1~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; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-2: assume !!(add_history_type_~tmp___1~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)); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-3: assume !(add_history_type_~tmp___1~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; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-3: assume !!(add_history_type_~tmp___1~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)); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: assume 0 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: assume !(0 == gate1_each_pals_period_~next_state~0#1); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume !(0 == ~gate2Failed~0 % 256); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: 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); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: assume !(1 == write_history_bool_~history_id#1); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189-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); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189-1: assume !(1 == write_history_bool_~history_id#1); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: assume ~VALUE2~0 == ~VALUE3~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: assume !(~VALUE2~0 == ~VALUE3~0); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume 1 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume !(1 == gate2_each_pals_period_~next_state~1#1); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: assume 2 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: assume !(2 == gate3_each_pals_period_~next_state~2#1);gate3_each_pals_period_~tmp___0~5#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: 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; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323-1: 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; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume ~VALUE2~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume !(~VALUE2~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: assume 1 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: assume !(1 == gate1_each_pals_period_~next_state~0#1); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume check_~tmp___11~0#1 != ~nomsg~0;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; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume !(check_~tmp___11~0#1 != ~nomsg~0); [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_bool_#res#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-1: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_bool_#res#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-2: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_bool_#res#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-3: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_bool_#res#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-4: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_bool_#res#1 := 0; [2025-02-08 14:52:39,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-5: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_bool_#res#1 := 0; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: 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; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume 2 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume !(2 == gate2_each_pals_period_~next_state~1#1);gate2_each_pals_period_~tmp___0~4#1 := 0; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: check_#t~ret28#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___12~0#1 := check_#t~ret28#1;havoc check_#t~ret28#1; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: add_history_type_#t~ret7#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;add_history_type_~tmp___2~0#1 := add_history_type_#t~ret7#1;havoc add_history_type_#t~ret7#1; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: add_history_type_#t~ret7#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;add_history_type_~tmp___2~0#1 := add_history_type_#t~ret7#1;havoc add_history_type_#t~ret7#1; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: add_history_type_#t~ret7#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;add_history_type_~tmp___2~0#1 := add_history_type_#t~ret7#1;havoc add_history_type_#t~ret7#1; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-3: add_history_type_#t~ret7#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;add_history_type_~tmp___2~0#1 := add_history_type_#t~ret7#1;havoc add_history_type_#t~ret7#1; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L524: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; [2025-02-08 14:52:39,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume !(~VALUE1~0 == check_~tmp___12~0#1);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; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume !!(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: 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); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: assume !(2 == write_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L194-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); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L194-1: assume !(2 == write_history_bool_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: assume !(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1);add_history_type_#res#1 := 0; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: assume !!(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: assume !(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1);add_history_type_#res#1 := 0; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: assume !!(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: assume !(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1);add_history_type_#res#1 := 0; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: assume !!(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-3: assume !(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1);add_history_type_#res#1 := 0; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-3: assume !!(add_history_type_~tmp___2~0#1 == add_history_type_~ini_int~0#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: assume 2 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: assume !(2 == gate1_each_pals_period_~next_state~0#1);gate1_each_pals_period_~tmp___0~3#1 := 0; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: check_#t~ret29#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___13~0#1 := check_#t~ret29#1;havoc check_#t~ret29#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: assume 0 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: assume !(0 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-1: assume 0 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-1: assume !(0 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-2: assume 0 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-2: assume !(0 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-3: assume 0 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-3: assume !(0 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-4: assume 0 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-4: assume !(0 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-5: assume 0 == read_history_bool_~history_id#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129-5: assume !(0 == read_history_bool_~history_id#1); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427: havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~g3v_new~0 := (if (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 <= 127 then (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 else (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 - 256); [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427-1: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: assume !(~VALUE2~0 == check_~tmp___13~0#1);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; [2025-02-08 14:52:39,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: assume !!(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-1: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-1: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-2: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-2: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-3: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-3: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-4: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-4: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-5: assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-5: assume !(0 == read_history_bool_~historyIndex#1); [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: check_#t~ret30#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___14~0#1 := check_#t~ret30#1;havoc check_#t~ret30#1; [2025-02-08 14:52:39,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_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; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: assume !(~VALUE1~0 != ~nomsg~0); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~g2v_new~0 := (if (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 <= 127 then (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 else (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 - 256); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396-1: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !(~VALUE3~0 == check_~tmp___14~0#1);check_#res#1 := 0; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !!(~VALUE3~0 == check_~tmp___14~0#1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: assume !(check_~temp_count~0#1 > 1);check_#res#1 := 0; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: assume !!(check_~temp_count~0#1 > 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: 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; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume 0 == check_~tmp___3~0#1 % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 1, 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; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume !(0 == check_~tmp___3~0#1 % 256); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L199-1: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-1: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-1: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-2: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-2: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-3: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-3: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-4: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-4: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-5: assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-5: assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~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); [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L365-1: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:52:39,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: check_#t~ret14#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___4~0#1 := (if 0 == check_#t~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#1; [2025-02-08 14:52:39,456 INFO L? ?]: Removed 436 outVars from TransFormulas that were not future-live. [2025-02-08 14:52:39,456 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:52:39,464 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:52:39,464 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:52:39,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:52:39 BoogieIcfgContainer [2025-02-08 14:52:39,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:52:39,465 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:52:39,465 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:52:39,468 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:52:39,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:52:39,469 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:52:38" (1/3) ... [2025-02-08 14:52:39,469 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47502527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:52:39, skipping insertion in model container [2025-02-08 14:52:39,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:52:39,470 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:52:38" (2/3) ... [2025-02-08 14:52:39,470 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47502527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:52:39, skipping insertion in model container [2025-02-08 14:52:39,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:52:39,470 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:52:39" (3/3) ... [2025-02-08 14:52:39,470 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-02-08 14:52:39,527 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:52:39,527 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:52:39,527 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:52:39,527 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:52:39,527 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:52:39,528 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:52:39,528 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:52:39,528 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:52:39,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 209 states, 190 states have (on average 1.8736842105263158) internal successors, (356), 208 states have internal predecessors, (356), 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-02-08 14:52:39,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2025-02-08 14:52:39,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:52:39,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:52:39,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:52:39,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:52:39,552 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:52:39,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 209 states, 190 states have (on average 1.8736842105263158) internal successors, (356), 208 states have internal predecessors, (356), 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-02-08 14:52:39,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2025-02-08 14:52:39,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:52:39,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:52:39,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:52:39,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:52:39,562 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(50, 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_~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-02-08 14:52:39,562 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-02-08 14:52:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1149, now seen corresponding path program 1 times [2025-02-08 14:52:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:39,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984662940] [2025-02-08 14:52:39,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:52:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:39,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:52:39,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:52:39,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:39,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:52:39,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:52:39,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:52:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:39,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:52:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash -428500584, now seen corresponding path program 1 times [2025-02-08 14:52:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:39,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429008836] [2025-02-08 14:52:39,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:52:39,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:52:39,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:52:39,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:39,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:39,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:52:39,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:52:39,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:52:39,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:39,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:52:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash 518476052, now seen corresponding path program 1 times [2025-02-08 14:52:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463839737] [2025-02-08 14:52:39,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:52:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:52:39,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:52:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:52:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:52:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:52:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463839737] [2025-02-08 14:52:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463839737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:52:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:52:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:52:39,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697505425] [2025-02-08 14:52:39,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:52:39,887 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:52:39,891 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:52:39,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:52:39,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:52:39,891 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:52:39,891 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:39,891 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:52:39,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:52:39,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c_Iteration1_Loop [2025-02-08 14:52:39,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:52:39,892 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:52:39,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:39,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:39,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,110 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:52:40,111 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:52:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:52:40,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:52:40,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:52:40,151 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:52:40,151 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-02-08 14:52:40,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:52:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:52:40,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:52:40,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:52:40,182 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:52:40,182 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-02-08 14:52:40,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-08 14:52:40,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:52:40,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:52:40,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:52:40,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:52:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:52:40,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:52:40,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:52:40,240 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:52:40,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:52:40,244 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:52:40,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:52:40,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:52:40,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:52:40,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:52:40,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:52:40,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:52:40,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c_Iteration1_Loop [2025-02-08 14:52:40,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:52:40,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:52:40,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,333 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:52:40,335 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:52:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,351 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-02-08 14:52:40,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:52:40,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:52:40,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:52:40,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:52:40,363 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:52:40,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:52:40,367 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-08 14:52:40,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:52:40,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:52:40,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:52:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:52:40,385 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-02-08 14:52:40,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:52:40,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:52:40,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:52:40,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:52:40,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:52:40,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:52:40,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:52:40,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:52:40,402 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:52:40,404 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:52:40,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:52:40,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:52:40,412 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:52:40,412 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:52:40,412 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-02-08 14:52:40,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:52:40,422 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:52:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:40,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:52:40,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:52:40,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:40,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:52:40,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:52:40,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:52:40,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:52:40,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:52:40,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:40,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:52:40,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:52:40,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:52:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:52:40,534 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-02-08 14:52:40,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 209 states, 190 states have (on average 1.8736842105263158) internal successors, (356), 208 states have internal predecessors, (356), 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-02-08 14:52:40,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:52:40,618 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 209 states, 190 states have (on average 1.8736842105263158) internal successors, (356), 208 states have internal predecessors, (356), 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 265 states and 440 transitions. Complement of second has 6 states. [2025-02-08 14:52:40,619 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-02-08 14:52:40,621 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-02-08 14:52:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-02-08 14:52:40,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 1 letters. Loop has 6 letters. [2025-02-08 14:52:40,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:52:40,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 7 letters. Loop has 6 letters. [2025-02-08 14:52:40,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:52:40,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 1 letters. Loop has 12 letters. [2025-02-08 14:52:40,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:52:40,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 440 transitions. [2025-02-08 14:52:40,634 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-02-08 14:52:40,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 29 states and 33 transitions. [2025-02-08 14:52:40,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-08 14:52:40,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:52:40,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2025-02-08 14:52:40,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:52:40,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-08 14:52:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2025-02-08 14:52:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 14:52:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:52:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-02-08 14:52:40,654 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-08 14:52:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:52:40,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:52:40,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:52:40,656 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-02-08 14:52:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:52:40,674 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-02-08 14:52:40,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2025-02-08 14:52:40,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-02-08 14:52:40,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 25 transitions. [2025-02-08 14:52:40,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-08 14:52:40,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:52:40,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2025-02-08 14:52:40,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:52:40,675 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-02-08 14:52:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2025-02-08 14:52:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-08 14:52:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:52:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-02-08 14:52:40,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-02-08 14:52:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:52:40,676 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-02-08 14:52:40,676 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:52:40,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2025-02-08 14:52:40,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-02-08 14:52:40,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:52:40,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:52:40,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:52:40,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:52:40,677 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(50, 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_~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-02-08 14:52:40,677 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-02-08 14:52:40,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1135452, now seen corresponding path program 1 times [2025-02-08 14:52:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:40,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077699322] [2025-02-08 14:52:40,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:52:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:52:40,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:52:40,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:40,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:52:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:52:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:52:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077699322] [2025-02-08 14:52:40,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077699322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:52:40,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:52:40,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:52:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299122849] [2025-02-08 14:52:40,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:52:40,743 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:52:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -452717864, now seen corresponding path program 1 times [2025-02-08 14:52:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698903907] [2025-02-08 14:52:40,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:52:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:40,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:52:40,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:52:40,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:40,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:40,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:52:40,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:52:40,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:52:40,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:40,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:52:40,793 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:52:40,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:52:40,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:52:40,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:52:40,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:52:40,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:52:40,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:52:40,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c_Iteration2_Loop [2025-02-08 14:52:40,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:52:40,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:52:40,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,890 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:52:40,890 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:52:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,893 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:52:40,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:52:40,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:52:40,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:52:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:40,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:40,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:52:40,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:52:40,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:52:40,955 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:52:40,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:52:40,959 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:52:40,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:52:40,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:52:40,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:52:40,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:52:40,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:40,960 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:52:40,960 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:52:40,960 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c_Iteration2_Loop [2025-02-08 14:52:40,960 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:52:40,960 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:52:40,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:40,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:52:41,108 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:52:41,108 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:52:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:41,112 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:41,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:52:41,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:52:41,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:52:41,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:52:41,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:52:41,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:52:41,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:52:41,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:52:41,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:52:41,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:52:41,128 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:52:41,128 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:52:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:52:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:52:41,130 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:52:41,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:52:41,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:52:41,135 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:52:41,135 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:52:41,135 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-02-08 14:52:41,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:52:41,141 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:52:41,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:52:41,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:52:41,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:41,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:52:41,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:52:41,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:52:41,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:52:41,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:52:41,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:41,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:52:41,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:52:41,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:52:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:52:41,288 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-02-08 14:52:41,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-08 14:52:41,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 29 states and 33 transitions. Complement of second has 5 states. [2025-02-08 14:52:41,299 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-02-08 14:52:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-08 14:52:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-02-08 14:52:41,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-08 14:52:41,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:52:41,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2025-02-08 14:52:41,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:52:41,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 3 letters. Loop has 12 letters. [2025-02-08 14:52:41,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:52:41,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2025-02-08 14:52:41,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:52:41,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 27 transitions. [2025-02-08 14:52:41,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-08 14:52:41,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-08 14:52:41,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2025-02-08 14:52:41,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:52:41,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-08 14:52:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2025-02-08 14:52:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 14:52:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-02-08 14:52:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-08 14:52:41,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-08 14:52:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:52:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:52:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:52:41,302 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-02-08 14:52:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:52:41,302 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2025-02-08 14:52:41,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2 states and 1 transitions. [2025-02-08 14:52:41,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:52:41,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2 states to 0 states and 0 transitions. [2025-02-08 14:52:41,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:52:41,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:52:41,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:52:41,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:52:41,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:52:41,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:52:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:52:41,303 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:52:41,303 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:52:41,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:52:41,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:52:41,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:52:41,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:52:41 BoogieIcfgContainer [2025-02-08 14:52:41,308 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:52:41,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:52:41,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:52:41,308 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:52:41,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:52:39" (3/4) ... [2025-02-08 14:52:41,310 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:52:41,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:52:41,311 INFO L158 Benchmark]: Toolchain (without parser) took 3284.39ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 59.3MB in the end (delta: 54.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-02-08 14:52:41,311 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:52:41,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.28ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 97.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:52:41,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 90.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:52:41,311 INFO L158 Benchmark]: Boogie Preprocessor took 50.83ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 83.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:52:41,312 INFO L158 Benchmark]: IcfgBuilder took 1069.01ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 54.7MB in the end (delta: 28.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2025-02-08 14:52:41,312 INFO L158 Benchmark]: BuchiAutomizer took 1843.00ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 59.3MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:52:41,312 INFO L158 Benchmark]: Witness Printer took 2.30ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 15.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:52:41,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.28ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 97.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 90.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.83ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 83.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1069.01ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 54.7MB in the end (delta: 28.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1843.00ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 59.3MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.30ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 15.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 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. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 111 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp69 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf100 smp100 dnf617 smp7 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:52:41,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:52:41,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE