./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1489629cdc9e883b5f9b8dace01f7ff19076a70dfbf3cfc1395e8493a3e654 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:56:37,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:56:37,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:56:37,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:56:37,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:56:37,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:56:37,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:56:37,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:56:37,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:56:37,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:56:37,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:56:37,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:56:37,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:56:37,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:56:37,200 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:56:37,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:56:37,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:56:37,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:56:37,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:56:37,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:56:37,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:56:37,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:56:37,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:56:37,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:56:37,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:56:37,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! call(reach_error())) ) 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 -> 1e1489629cdc9e883b5f9b8dace01f7ff19076a70dfbf3cfc1395e8493a3e654 [2025-02-07 21:56:37,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:56:37,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:56:37,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:56:37,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:56:37,482 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:56:37,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c [2025-02-07 21:56:38,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eb113ae9/1a0cf41bbda04fefa21e7714d37b07fc/FLAGdb51d3f34 [2025-02-07 21:56:40,349 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:56:40,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c [2025-02-07 21:56:40,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eb113ae9/1a0cf41bbda04fefa21e7714d37b07fc/FLAGdb51d3f34 [2025-02-07 21:56:40,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eb113ae9/1a0cf41bbda04fefa21e7714d37b07fc [2025-02-07 21:56:40,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:56:40,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:56:40,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:56:40,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:56:40,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:56:40,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:56:40" (1/1) ... [2025-02-07 21:56:40,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761d852f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:40, skipping insertion in model container [2025-02-07 21:56:40,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:56:40" (1/1) ... [2025-02-07 21:56:40,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:56:41,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[26897,26910] [2025-02-07 21:56:41,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[34187,34200] [2025-02-07 21:56:41,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:56:41,705 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:56:41,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[26897,26910] [2025-02-07 21:56:41,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[34187,34200] [2025-02-07 21:56:41,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:56:42,002 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:56:42,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42 WrapperNode [2025-02-07 21:56:42,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:56:42,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:56:42,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:56:42,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:56:42,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,272 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5288 [2025-02-07 21:56:42,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:56:42,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:56:42,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:56:42,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:56:42,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,473 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-07 21:56:42,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:56:42,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:56:42,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:56:42,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:56:42,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (1/1) ... [2025-02-07 21:56:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:56:42,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:56:42,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:56:42,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:56:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:56:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:56:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:56:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:56:42,914 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:56:42,916 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:56:46,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L234: assume node6_~m6~0#1 > ~id6~0;~send6~0 := node6_~m6~0#1; [2025-02-07 21:56:46,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L234: assume !(node6_~m6~0#1 > ~id6~0); [2025-02-07 21:56:46,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; [2025-02-07 21:56:46,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; [2025-02-07 21:56:46,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5520: main_#t~ret56#1 := main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~nondet7#1, main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~ret38#1, main1_#t~ret39#1, main1_#t~post40#1, main1_~c1~0#1, main1_~i2~0#1;assume { :end_inline_main1 } true;assume -2147483648 <= main_#t~ret56#1 && main_#t~ret56#1 <= 2147483647; [2025-02-07 21:56:46,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L237: assume node6_~m6~0#1 == ~id6~0;~st6~0 := 1; [2025-02-07 21:56:46,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L237: assume !(node6_~m6~0#1 == ~id6~0); [2025-02-07 21:56:46,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: assume node1_~m1~0#1 != ~nomsg~0; [2025-02-07 21:56:46,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: assume !(node1_~m1~0#1 != ~nomsg~0); [2025-02-07 21:56:46,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: assume node1_~m1~0#1 > ~id1~0;~send1~0 := node1_~m1~0#1; [2025-02-07 21:56:46,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: assume !(node1_~m1~0#1 > ~id1~0); [2025-02-07 21:56:46,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: ~mode6~0 := 0; [2025-02-07 21:56:46,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; [2025-02-07 21:56:46,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume !(node1_~m1~0#1 == ~id1~0);~send1~0 := node1_~m1~0#1; [2025-02-07 21:56:46,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: assume main1_~i2~0#1 < 16;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; [2025-02-07 21:56:46,350 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: assume !(main1_~i2~0#1 < 16);main1_#res#1 := 0; [2025-02-07 21:56:46,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L644: havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; [2025-02-07 21:56:46,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: ~mode1~0 := 0; [2025-02-07 21:56:46,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; [2025-02-07 21:56:46,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc node3_~m3~0#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L647: havoc node4_~m4~0#1;assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L648: havoc node5_~m5~0#1;assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc node6_~m6~0#1;assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L650: havoc node7_~m7~0#1;assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc node8_~m8~0#1;assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume !(0 != ~mode7~0 % 256);~p7_new~0 := (if (if ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0 then ~send7~0 else ~p7_new~0) % 256 <= 127 then (if ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0 then ~send7~0 else ~p7_new~0) % 256 else (if ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0 then ~send7~0 else ~p7_new~0) % 256 - 256);~mode7~0 := 1; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume node7_~m7~0#1 != ~nomsg~0; [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume !(node7_~m7~0#1 != ~nomsg~0); [2025-02-07 21:56:46,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: assume node7_~m7~0#1 > ~id7~0;~send7~0 := node7_~m7~0#1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: assume !(node7_~m7~0#1 > ~id7~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret50#1;main2_#t~ret54#1 := calculate_output_#res#1;havoc calculate_output_#t~ret50#1, calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret54#1 && main2_#t~ret54#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret54#1;havoc main2_~input~0#1;havoc main2_#t~ret54#1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: assume node7_~m7~0#1 == ~id7~0;~st7~0 := 1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: assume !(node7_~m7~0#1 == ~id7~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: assume node2_~m2~0#1 != ~nomsg~0; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: assume !(node2_~m2~0#1 != ~nomsg~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: ~mode7~0 := 0; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: assume node2_~m2~0#1 > ~id2~0;~send2~0 := node2_~m2~0#1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: assume !(node2_~m2~0#1 > ~id2~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: assume !(node2_~m2~0#1 == ~id2~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L668: main1_#t~ret39#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret39#1 && main1_#t~ret39#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret39#1;havoc main1_#t~ret39#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L669: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main1_#t~post40#1 := main1_~i2~0#1;main1_~i2~0#1 := 1 + main1_#t~post40#1;havoc main1_#t~post40#1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: ~mode2~0 := 0; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume !(0 != ~mode8~0 % 256);~p8_new~0 := (if (if ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0 then ~send8~0 else ~p8_new~0) % 256 <= 127 then (if ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0 then ~send8~0 else ~p8_new~0) % 256 else (if ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0 then ~send8~0 else ~p8_new~0) % 256 - 256);~mode8~0 := 1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume node8_~m8~0#1 != ~nomsg~0; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume !(node8_~m8~0#1 != ~nomsg~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume node8_~m8~0#1 > ~id8~0;~send8~0 := node8_~m8~0#1; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume !(node8_~m8~0#1 > ~id8~0); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume 0 == assert_~arg#1 % 256; [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume !(0 == assert_~arg#1 % 256); [2025-02-07 21:56:46,353 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret51#1;calculate_output_#t~ret50#1 := calculate_output2_#res#1;havoc calculate_output2_#t~ret51#1, calculate_output2_~input#1;havoc calculate_output2_#in~input#1;assume { :end_inline_calculate_output2 } true;assume -2147483648 <= calculate_output_#t~ret50#1 && calculate_output_#t~ret50#1 <= 2147483647;calculate_output_#res#1 := calculate_output_#t~ret50#1;havoc calculate_output_#t~ret50#1; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: assume false;assume false; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: assume !false; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L287: assume node8_~m8~0#1 == ~id8~0;~st8~0 := 1; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L287: assume !(node8_~m8~0#1 == ~id8~0); [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155: assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155: assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: assume node3_~m3~0#1 != ~nomsg~0; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: assume !(node3_~m3~0#1 != ~nomsg~0); [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: ~mode8~0 := 0; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159: assume node3_~m3~0#1 > ~id3~0;~send3~0 := node3_~m3~0#1; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159: assume !(node3_~m3~0#1 > ~id3~0); [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L162: assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L162: assume !(node3_~m3~0#1 == ~id3~0); [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L32: assume 0 == assume_abort_if_not_~cond#1;assume false; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L32: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: assume ~r1~0 >= 8; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: assume !(~r1~0 >= 8); [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: ~mode3~0 := 0; [2025-02-07 21:56:46,354 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0);check_~tmp~1#1 := 0; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: assume ~r1~0 < 8;check_~tmp~1#1 := 1; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: assume !(~r1~0 < 8); [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: assume 1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0;check_~tmp~1#1 := 1; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0);check_~tmp~1#1 := 0; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: assume node4_~m4~0#1 != ~nomsg~0; [2025-02-07 21:56:46,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: assume !(node4_~m4~0#1 != ~nomsg~0); [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L580-1: check_#res#1 := check_~tmp~1#1; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: assume node4_~m4~0#1 > ~id4~0;~send4~0 := node4_~m4~0#1; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: assume !(node4_~m4~0#1 > ~id4~0); [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: assume !(node4_~m4~0#1 == ~id4~0); [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344-2: calculate_output3_#t~ret52#1 := calculate_output4_#res#1;havoc calculate_output4_~input#1;havoc calculate_output4_#in~input#1;assume { :end_inline_calculate_output4 } true;assume -2147483648 <= calculate_output3_#t~ret52#1 && calculate_output3_#t~ret52#1 <= 2147483647;calculate_output3_#res#1 := calculate_output3_#t~ret52#1;havoc calculate_output3_#t~ret52#1; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: ~mode4~0 := 0; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret52#1;calculate_output2_#t~ret51#1 := calculate_output3_#res#1;havoc calculate_output3_#t~ret52#1, calculate_output3_~input#1;havoc calculate_output3_#in~input#1;assume { :end_inline_calculate_output3 } true;assume -2147483648 <= calculate_output2_#t~ret51#1 && calculate_output2_#t~ret51#1 <= 2147483647;calculate_output2_#res#1 := calculate_output2_#t~ret51#1;havoc calculate_output2_#t~ret51#1; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: assume node5_~m5~0#1 != ~nomsg~0; [2025-02-07 21:56:46,358 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: assume !(node5_~m5~0#1 != ~nomsg~0); [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: assume node5_~m5~0#1 > ~id5~0;~send5~0 := node5_~m5~0#1; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: assume !(node5_~m5~0#1 > ~id5~0); [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: assume !(node5_~m5~0#1 == ~id5~0); [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: ~mode5~0 := 0; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: main1_#t~ret38#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret38#1 && main1_#t~ret38#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret38#1;havoc main1_#t~ret38#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: assume !(0 != ~mode6~0 % 256);~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256);~mode6~0 := 1; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L233: assume node6_~m6~0#1 != ~nomsg~0; [2025-02-07 21:56:46,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L233: assume !(node6_~m6~0#1 != ~nomsg~0); [2025-02-07 21:56:46,730 INFO L? ?]: Removed 1386 outVars from TransFormulas that were not future-live. [2025-02-07 21:56:46,734 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:56:46,765 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:56:46,770 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:56:46,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:56:46 BoogieIcfgContainer [2025-02-07 21:56:46,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:56:46,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:56:46,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:56:46,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:56:46,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:56:40" (1/3) ... [2025-02-07 21:56:46,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d43f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:56:46, skipping insertion in model container [2025-02-07 21:56:46,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:56:42" (2/3) ... [2025-02-07 21:56:46,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d43f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:56:46, skipping insertion in model container [2025-02-07 21:56:46,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:56:46" (3/3) ... [2025-02-07 21:56:46,778 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c [2025-02-07 21:56:46,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:56:46,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c that has 1 procedures, 822 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-07 21:56:46,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:56:46,851 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73a78586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:56:46,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:56:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 814 states have (on average 1.9950859950859952) internal successors, (1624), 821 states have internal predecessors, (1624), 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-07 21:56:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 21:56:46,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:56:46,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:56:46,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:56:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:56:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 535032006, now seen corresponding path program 1 times [2025-02-07 21:56:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:56:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635845199] [2025-02-07 21:56:46,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:56:46,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:56:46,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 21:56:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 21:56:46,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:56:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:56:47,044 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-07 21:56:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:56:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635845199] [2025-02-07 21:56:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635845199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:56:47,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:56:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:56:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446008273] [2025-02-07 21:56:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:56:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:56:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:56:47,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:56:47,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:56:47,065 INFO L87 Difference]: Start difference. First operand has 822 states, 814 states have (on average 1.9950859950859952) internal successors, (1624), 821 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-07 21:56:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:56:47,121 INFO L93 Difference]: Finished difference Result 1572 states and 3114 transitions. [2025-02-07 21:56:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:56:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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) Word has length 62 [2025-02-07 21:56:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:56:47,127 INFO L225 Difference]: With dead ends: 1572 [2025-02-07 21:56:47,127 INFO L226 Difference]: Without dead ends: 63 [2025-02-07 21:56:47,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:56:47,133 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:56:47,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:56:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-07 21:56:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-07 21:56:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.0) internal successors, (62), 62 states have internal predecessors, (62), 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-07 21:56:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 62 transitions. [2025-02-07 21:56:47,177 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 62 transitions. Word has length 62 [2025-02-07 21:56:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:56:47,178 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 62 transitions. [2025-02-07 21:56:47,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-07 21:56:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 62 transitions. [2025-02-07 21:56:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 21:56:47,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:56:47,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:56:47,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:56:47,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:56:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:56:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1546536006, now seen corresponding path program 1 times [2025-02-07 21:56:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:56:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086804855] [2025-02-07 21:56:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:56:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:56:47,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 21:56:47,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 21:56:47,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:56:47,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:56:47,603 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-07 21:56:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:56:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086804855] [2025-02-07 21:56:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086804855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:56:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:56:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:56:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327901006] [2025-02-07 21:56:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:56:47,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:56:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:56:47,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:56:47,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:56:47,608 INFO L87 Difference]: Start difference. First operand 63 states and 62 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-07 21:56:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:56:47,692 INFO L93 Difference]: Finished difference Result 63 states and 62 transitions. [2025-02-07 21:56:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:56:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2025-02-07 21:56:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:56:47,696 INFO L225 Difference]: With dead ends: 63 [2025-02-07 21:56:47,696 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:56:47,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:56:47,697 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:56:47,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:56:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:56:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:56:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07 21:56:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:56:47,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2025-02-07 21:56:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:56:47,699 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:56:47,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-07 21:56:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:56:47,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:56:47,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:56:47,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:56:47,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:56:47,706 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:56:47,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:56:47,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:56:47,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:56:47 BoogieIcfgContainer [2025-02-07 21:56:47,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:56:47,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:56:47,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:56:47,737 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:56:47,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:56:46" (3/4) ... [2025-02-07 21:56:47,739 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:56:47,783 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-07 21:56:47,788 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:56:47,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:56:47,798 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:56:48,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:56:48,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:56:48,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:56:48,055 INFO L158 Benchmark]: Toolchain (without parser) took 7263.39ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 118.5MB in the beginning and 262.9MB in the end (delta: -144.4MB). Peak memory consumption was 524.4MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,055 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:56:48,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1206.92ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 94.5MB in the end (delta: 23.7MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 268.64ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 94.5MB in the beginning and 222.5MB in the end (delta: -128.1MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,059 INFO L158 Benchmark]: Boogie Preprocessor took 459.42ms. Allocated memory is still 335.5MB. Free memory was 222.5MB in the beginning and 209.9MB in the end (delta: 12.6MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,059 INFO L158 Benchmark]: IcfgBuilder took 4036.89ms. Allocated memory was 335.5MB in the beginning and 838.9MB in the end (delta: 503.3MB). Free memory was 209.9MB in the beginning and 426.5MB in the end (delta: -216.5MB). Peak memory consumption was 286.3MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,059 INFO L158 Benchmark]: TraceAbstraction took 962.90ms. Allocated memory is still 838.9MB. Free memory was 426.5MB in the beginning and 321.6MB in the end (delta: 104.9MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,059 INFO L158 Benchmark]: Witness Printer took 317.85ms. Allocated memory is still 838.9MB. Free memory was 321.6MB in the beginning and 262.9MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-07 21:56:48,061 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.31ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1206.92ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 94.5MB in the end (delta: 23.7MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 268.64ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 94.5MB in the beginning and 222.5MB in the end (delta: -128.1MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 459.42ms. Allocated memory is still 335.5MB. Free memory was 222.5MB in the beginning and 209.9MB in the end (delta: 12.6MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. * IcfgBuilder took 4036.89ms. Allocated memory was 335.5MB in the beginning and 838.9MB in the end (delta: 503.3MB). Free memory was 209.9MB in the beginning and 426.5MB in the end (delta: -216.5MB). Peak memory consumption was 286.3MB. Max. memory is 16.1GB. * TraceAbstraction took 962.90ms. Allocated memory is still 838.9MB. Free memory was 426.5MB in the beginning and 321.6MB in the end (delta: 104.9MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 317.85ms. Allocated memory is still 838.9MB. Free memory was 321.6MB in the beginning and 262.9MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 683]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 887]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 822 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 1564 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1564 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 5507]: Location Invariant Derived location invariant: (((((a2 <= 170) && (a5 == 4)) && (a7 == 13)) && (a24 != 13)) && (((long long) a17 + 124) <= 0)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:56:48,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE