./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.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/Problem05_label47+token_ring.02.cil-1.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 e29588631802f33e276df8c8a4376435a271a426c8b5d54fd1eb814b142c7499 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:42:25,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:42:25,944 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:42:25,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:42:25,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:42:25,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:42:25,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:42:25,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:42:25,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:42:25,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:42:25,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:42:25,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:42:25,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:42:25,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:42:25,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:42:25,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:42:25,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:42:25,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:42:25,965 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 -> e29588631802f33e276df8c8a4376435a271a426c8b5d54fd1eb814b142c7499 [2025-02-07 21:42:26,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:42:26,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:42:26,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:42:26,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:42:26,142 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:42:26,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c [2025-02-07 21:42:27,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45b8fb9dd/cef74a63dc7f4eaabdb56391210e5689/FLAGe679e5309 [2025-02-07 21:42:28,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:42:28,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c [2025-02-07 21:42:28,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45b8fb9dd/cef74a63dc7f4eaabdb56391210e5689/FLAGe679e5309 [2025-02-07 21:42:28,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45b8fb9dd/cef74a63dc7f4eaabdb56391210e5689 [2025-02-07 21:42:28,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:42:28,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:42:28,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:42:28,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:42:28,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:42:28,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:42:28" (1/1) ... [2025-02-07 21:42:28,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebba920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:28, skipping insertion in model container [2025-02-07 21:42:28,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:42:28" (1/1) ... [2025-02-07 21:42:28,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:42:29,534 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/Problem05_label47+token_ring.02.cil-1.c[377612,377625] [2025-02-07 21:42:29,562 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/Problem05_label47+token_ring.02.cil-1.c[383339,383352] [2025-02-07 21:42:29,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:42:29,697 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:42:30,176 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/Problem05_label47+token_ring.02.cil-1.c[377612,377625] [2025-02-07 21:42:30,182 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/Problem05_label47+token_ring.02.cil-1.c[383339,383352] [2025-02-07 21:42:30,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:42:30,226 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:42:30,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30 WrapperNode [2025-02-07 21:42:30,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:42:30,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:42:30,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:42:30,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:42:30,232 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:42:30" (1/1) ... [2025-02-07 21:42:30,288 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:42:30" (1/1) ... [2025-02-07 21:42:30,607 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12615 [2025-02-07 21:42:30,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:42:30,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:42:30,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:42:30,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:42:30,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,719 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:42:30,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:42:30,894 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:42:30,894 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:42:30,894 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:42:30,894 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (1/1) ... [2025-02-07 21:42:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:42:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:42:30,927 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:42:30,932 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:42:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:42:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-07 21:42:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-07 21:42:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-07 21:42:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-07 21:42:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-07 21:42:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-07 21:42:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-07 21:42:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-07 21:42:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-07 21:42:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-07 21:42:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:42:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-07 21:42:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-07 21:42:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:42:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:42:31,001 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:42:31,002 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:42:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1;calculate_output2_#t~ret15#1 := calculate_output3_#res#1;havoc calculate_output3_#t~ret16#1, calculate_output3_~input#1;havoc calculate_output3_#in~input#1;assume { :end_inline_calculate_output3 } true;assume -2147483648 <= calculate_output2_#t~ret15#1 && calculate_output2_#t~ret15#1 <= 2147483647;calculate_output2_#res#1 := calculate_output2_#t~ret15#1;havoc calculate_output2_#t~ret15#1; [2025-02-07 21:42:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11627: assume 1 == ~M_E~0;~M_E~0 := 2; [2025-02-07 21:42:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11627: assume !(1 == ~M_E~0); [2025-02-07 21:42:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11632: assume 1 == ~T1_E~0;~T1_E~0 := 2; [2025-02-07 21:42:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11632: assume !(1 == ~T1_E~0); [2025-02-07 21:42:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11637: assume 1 == ~T2_E~0;~T2_E~0 := 2; [2025-02-07 21:42:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11637: assume !(1 == ~T2_E~0); [2025-02-07 21:42:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11642: assume 1 == ~E_M~0;~E_M~0 := 2; [2025-02-07 21:42:37,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11642: assume !(1 == ~E_M~0); [2025-02-07 21:42:37,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11647: assume 1 == ~E_1~0;~E_1~0 := 2; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11647: assume !(1 == ~E_1~0); [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11384: assume 1 == ~m_i~0;~m_st~0 := 0; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11384: assume !(1 == ~m_i~0);~m_st~0 := 2; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11652: assume 1 == ~E_2~0;~E_2~0 := 2; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11652: assume !(1 == ~E_2~0); [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11389: assume 1 == ~t1_i~0;~t1_st~0 := 0; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11389: assume !(1 == ~t1_i~0);~t1_st~0 := 2; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11394: assume 1 == ~t2_i~0;~t2_st~0 := 0; [2025-02-07 21:42:37,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11394: assume !(1 == ~t2_i~0);~t2_st~0 := 2; [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11678-1: SUMMARY for call stop_simulation_#t~ret35#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11678: assume -2147483648 <= stop_simulation_#t~ret35#1 && stop_simulation_#t~ret35#1 <= 2147483647;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret35#1;havoc stop_simulation_#t~ret35#1; [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11680: assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11680: assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1;calculate_output4_#t~ret17#1 := calculate_output5_#res#1;havoc calculate_output5_#t~ret18#1, calculate_output5_~input#1;havoc calculate_output5_#in~input#1;assume { :end_inline_calculate_output5 } true;assume -2147483648 <= calculate_output4_#t~ret17#1 && calculate_output4_#t~ret17#1 <= 2147483647;calculate_output4_#res#1 := calculate_output4_#t~ret17#1;havoc calculate_output4_#t~ret17#1; [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11434: assume true; [2025-02-07 21:42:37,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11434: assume !true; [2025-02-07 21:42:37,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11699-1: SUMMARY for call update_channels(); srcloc: null [2025-02-07 21:42:37,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11699: assume { :begin_inline_init_threads } true; [2025-02-07 21:42:37,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11700: assume { :end_inline_init_threads } true; [2025-02-07 21:42:37,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11701: SUMMARY for call fire_delta_events(); srcloc: null [2025-02-07 21:42:37,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11437-1: SUMMARY for call eval_#t~ret28#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:42:37,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11437: assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11173: assume false;assume false; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11173: assume !false; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11702: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11703: SUMMARY for call reset_delta_events(); srcloc: null [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11439: assume 0 != eval_~tmp~0#1; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11439: assume !(0 != eval_~tmp~0#1); [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11706: assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11706: assume !true; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11444: havoc eval_~tmp_ndt_1~0#1; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11444-1: assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;havoc eval_#t~nondet29#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11444-1: assume !(0 == ~m_st~0); [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11710: havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-07 21:42:37,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11447: assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11447: assume !(0 != eval_~tmp_ndt_1~0#1); [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11714: start_simulation_~kernel_st~0#1 := 3; [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11450: havoc master_#t~nondet27#1;assume { :end_inline_master } true; [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11714-1: SUMMARY for call update_channels(); srcloc: null [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11718: SUMMARY for call fire_delta_events(); srcloc: null [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11719: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11720: SUMMARY for call reset_delta_events(); srcloc: null [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11458: havoc eval_~tmp_ndt_2~0#1; [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11458-1: assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;havoc eval_#t~nondet30#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_2~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; [2025-02-07 21:42:37,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11458-1: assume !(0 == ~t1_st~0); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11723-1: SUMMARY for call start_simulation_#t~ret36#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11723: assume -2147483648 <= start_simulation_#t~ret36#1 && start_simulation_#t~ret36#1 <= 2147483647;start_simulation_~tmp~3#1 := start_simulation_#t~ret36#1;havoc start_simulation_#t~ret36#1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11725: assume 0 == start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 4;assume { :begin_inline_fire_time_events } true;~M_E~0 := 1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11725: assume !(0 == start_simulation_~tmp~3#1); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11461: assume 0 != eval_~tmp_ndt_2~0#1;~t1_st~0 := 1;assume { :begin_inline_transmit1 } true; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11461: assume !(0 != eval_~tmp_ndt_2~0#1); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11728: assume { :end_inline_fire_time_events } true; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11464: assume { :end_inline_transmit1 } true; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11729-1: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11729: assume { :begin_inline_reset_time_events } true; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11730: assume { :end_inline_reset_time_events } true; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11203: assume 0 == ~m_pc~0; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11203: assume !(0 == ~m_pc~0); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11206: assume 1 == ~m_pc~0; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11206: assume !(1 == ~m_pc~0); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11736: start_simulation_#t~ret37#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret35#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;assume -2147483648 <= start_simulation_#t~ret37#1 && start_simulation_#t~ret37#1 <= 2147483647;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret37#1;havoc start_simulation_#t~ret37#1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11736-1: assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret35#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11472: havoc eval_~tmp_ndt_3~0#1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11472-1: assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;havoc eval_#t~nondet31#1;assume -2147483648 <= eval_#t~nondet31#1 && eval_#t~nondet31#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet31#1;havoc eval_#t~nondet31#1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11472-1: assume !(0 == ~t2_st~0); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11738: assume 0 != start_simulation_~tmp___0~1#1; [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11738: assume !(0 != start_simulation_~tmp___0~1#1); [2025-02-07 21:42:37,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11475: assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; [2025-02-07 21:42:37,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11475: assume !(0 != eval_~tmp_ndt_3~0#1); [2025-02-07 21:42:37,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11478: assume { :end_inline_transmit2 } true; [2025-02-07 21:42:37,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11214: assume true;havoc master_#t~nondet27#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;~token~0 := master_#t~nondet27#1;havoc master_#t~nondet27#1;~local~0 := ~token~0;~E_1~0 := 1; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11214: assume !true; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11220: ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11220-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1;calculate_output_#t~ret14#1 := calculate_output2_#res#1;havoc calculate_output2_#t~ret15#1, calculate_output2_~input#1;havoc calculate_output2_#in~input#1;assume { :end_inline_calculate_output2 } true;assume -2147483648 <= calculate_output_#t~ret14#1 && calculate_output_#t~ret14#1 <= 2147483647;calculate_output_#res#1 := calculate_output_#t~ret14#1;havoc calculate_output_#t~ret14#1; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11755: assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11756: havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;assume { :end_inline_start_simulation } true;main2_~__retres1~4#1 := 0;main2_#res#1 := main2_~__retres1~4#1; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11228: assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11228: assume !(~token~0 != 2 + ~local~0); [2025-02-07 21:42:37,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11230: assume { :end_inline_error } true; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1;calculate_output6_#t~ret19#1 := calculate_output7_#res#1;havoc calculate_output7_#t~ret20#1, calculate_output7_~input#1;havoc calculate_output7_#in~input#1;assume { :end_inline_calculate_output7 } true;assume -2147483648 <= calculate_output6_#t~ret19#1 && calculate_output6_#t~ret19#1 <= 2147483647;calculate_output6_#res#1 := calculate_output6_#t~ret19#1;havoc calculate_output6_#t~ret19#1; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440-2: calculate_output7_#t~ret20#1 := calculate_output8_#res#1;havoc calculate_output8_~input#1;havoc calculate_output8_#in~input#1;assume { :end_inline_calculate_output8 } true;assume -2147483648 <= calculate_output7_#t~ret20#1 && calculate_output7_#t~ret20#1 <= 2147483647;calculate_output7_#res#1 := calculate_output7_#t~ret20#1;havoc calculate_output7_#t~ret20#1; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11767: main_#t~ret40#1 := main2_#res#1;havoc main2_~__retres1~4#1;assume { :end_inline_main2 } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11247: assume 0 == ~t1_pc~0; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11247: assume !(0 == ~t1_pc~0); [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11250: assume 1 == ~t1_pc~0; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11250: assume !(1 == ~t1_pc~0); [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11258: assume true;~t1_pc~0 := 1;~t1_st~0 := 2; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11258: assume !true; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11266: ~token~0 := 1 + ~token~0;~E_2~0 := 1; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11268: ~E_2~0 := 2; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11268-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11283: assume 0 == ~t2_pc~0; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11283: assume !(0 == ~t2_pc~0); [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11286: assume 1 == ~t2_pc~0; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11286: assume !(1 == ~t2_pc~0); [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11294: assume true;~t2_pc~0 := 1;~t2_st~0 := 2; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11294: assume !true; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1;calculate_output5_#t~ret18#1 := calculate_output6_#res#1;havoc calculate_output6_#t~ret19#1, calculate_output6_~input#1;havoc calculate_output6_#in~input#1;assume { :end_inline_calculate_output6 } true;assume -2147483648 <= calculate_output5_#t~ret18#1 && calculate_output5_#t~ret18#1 <= 2147483647;calculate_output5_#res#1 := calculate_output5_#t~ret18#1;havoc calculate_output5_#t~ret18#1; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11302: ~token~0 := 1 + ~token~0;~E_M~0 := 1; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11304: ~E_M~0 := 2; [2025-02-07 21:42:37,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11304-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:42:37,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1;calculate_output3_#t~ret16#1 := calculate_output4_#res#1;havoc calculate_output4_#t~ret17#1, calculate_output4_~input#1;havoc calculate_output4_#in~input#1;assume { :end_inline_calculate_output4 } true;assume -2147483648 <= calculate_output3_#t~ret16#1 && calculate_output3_#t~ret16#1 <= 2147483647;calculate_output3_#res#1 := calculate_output3_#t~ret16#1;havoc calculate_output3_#t~ret16#1; [2025-02-07 21:42:37,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1;main1_#t~ret22#1 := calculate_output_#res#1;havoc calculate_output_#t~ret14#1, calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~output~0#1 := main1_#t~ret22#1;havoc main1_~input~0#1;havoc main1_#t~ret22#1; [2025-02-07 21:42:37,758 INFO L? ?]: Removed 3292 outVars from TransFormulas that were not future-live. [2025-02-07 21:42:37,758 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:42:37,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:42:37,813 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:42:37,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:42:37 BoogieIcfgContainer [2025-02-07 21:42:37,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:42:37,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:42:37,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:42:37,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:42:37,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:42:28" (1/3) ... [2025-02-07 21:42:37,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e96a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:42:37, skipping insertion in model container [2025-02-07 21:42:37,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:42:30" (2/3) ... [2025-02-07 21:42:37,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e96a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:42:37, skipping insertion in model container [2025-02-07 21:42:37,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:42:37" (3/3) ... [2025-02-07 21:42:37,827 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.02.cil-1.c [2025-02-07 21:42:37,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:42:37,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.02.cil-1.c that has 7 procedures, 2175 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2025-02-07 21:42:37,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:42:37,917 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;@4ebaef94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:42:37,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:42:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 2127 states, 2115 states have (on average 1.8988179669030734) internal successors, (4016), 2126 states have internal predecessors, (4016), 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:42:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1656 [2025-02-07 21:42:38,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:42:38,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:38,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:42:38,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:42:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -317505020, now seen corresponding path program 1 times [2025-02-07 21:42:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:42:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862562835] [2025-02-07 21:42:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:42:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:42:38,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1655 statements into 1 equivalence classes. [2025-02-07 21:42:38,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1655 of 1655 statements. [2025-02-07 21:42:38,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:42:38,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:42:40,171 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:42:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:42:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862562835] [2025-02-07 21:42:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862562835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:42:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:42:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:42:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656325740] [2025-02-07 21:42:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:42:40,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:42:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:42:40,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:42:40,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:42:40,204 INFO L87 Difference]: Start difference. First operand has 2127 states, 2115 states have (on average 1.8988179669030734) internal successors, (4016), 2126 states have internal predecessors, (4016), 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 827.5) internal successors, (1655), 2 states have internal predecessors, (1655), 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:42:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:42:40,287 INFO L93 Difference]: Finished difference Result 2191 states and 4139 transitions. [2025-02-07 21:42:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:42:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 827.5) internal successors, (1655), 2 states have internal predecessors, (1655), 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 1655 [2025-02-07 21:42:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:42:40,309 INFO L225 Difference]: With dead ends: 2191 [2025-02-07 21:42:40,309 INFO L226 Difference]: Without dead ends: 1656 [2025-02-07 21:42:40,312 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:42:40,317 INFO L435 NwaCegarLoop]: 3952 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, 3952 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:42:40,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:42:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-02-07 21:42:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-02-07 21:42:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.0) internal successors, (1655), 1655 states have internal predecessors, (1655), 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:42:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1655 transitions. [2025-02-07 21:42:40,390 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1655 transitions. Word has length 1655 [2025-02-07 21:42:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:42:40,395 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 1655 transitions. [2025-02-07 21:42:40,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 827.5) internal successors, (1655), 2 states have internal predecessors, (1655), 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:42:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1655 transitions. [2025-02-07 21:42:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1656 [2025-02-07 21:42:40,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:42:40,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:42:40,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:42:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:42:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 195510690, now seen corresponding path program 1 times [2025-02-07 21:42:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:42:40,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380709227] [2025-02-07 21:42:40,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:42:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:42:40,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1655 statements into 1 equivalence classes. [2025-02-07 21:42:40,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1655 of 1655 statements. [2025-02-07 21:42:40,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:42:40,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:42:42,761 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:42:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:42:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380709227] [2025-02-07 21:42:42,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380709227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:42:42,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:42:42,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:42:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277848240] [2025-02-07 21:42:42,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:42:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:42:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:42:42,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:42:42,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:42:42,772 INFO L87 Difference]: Start difference. First operand 1656 states and 1655 transitions. Second operand has 3 states, 3 states have (on average 551.6666666666666) internal successors, (1655), 2 states have internal predecessors, (1655), 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:42:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:42:44,247 INFO L93 Difference]: Finished difference Result 1656 states and 1655 transitions. [2025-02-07 21:42:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:42:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 551.6666666666666) internal successors, (1655), 2 states have internal predecessors, (1655), 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 1655 [2025-02-07 21:42:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:42:44,250 INFO L225 Difference]: With dead ends: 1656 [2025-02-07 21:42:44,250 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:42:44,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:42:44,252 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:42:44,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 21:42:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:42:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:42:44,252 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:42:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:42:44,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1655 [2025-02-07 21:42:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:42:44,253 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:42:44,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.6666666666666) internal successors, (1655), 2 states have internal predecessors, (1655), 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:42:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:42:44,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:42:44,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:42:44,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:42:44,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:42:44,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:42:44,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:42:44,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:42:44,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:42:44 BoogieIcfgContainer [2025-02-07 21:42:44,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:42:44,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:42:44,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:42:44,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:42:44,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:42:37" (3/4) ... [2025-02-07 21:42:44,282 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:42:44,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-02-07 21:42:44,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2025-02-07 21:42:44,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-02-07 21:42:44,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-02-07 21:42:44,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-02-07 21:42:44,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-02-07 21:42:44,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-07 21:42:44,363 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:42:44,367 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:42:44,370 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:42:44,750 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:42:44,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:42:44,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:42:44,753 INFO L158 Benchmark]: Toolchain (without parser) took 16448.56ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 71.5MB in the beginning and 517.9MB in the end (delta: -446.3MB). Peak memory consumption was 249.2MB. Max. memory is 16.1GB. [2025-02-07 21:42:44,756 INFO L158 Benchmark]: CDTParser took 0.15ms. 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:42:44,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1922.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 71.5MB in the beginning and 134.5MB in the end (delta: -63.0MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2025-02-07 21:42:44,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 379.69ms. Allocated memory is still 302.0MB. Free memory was 134.5MB in the beginning and 153.9MB in the end (delta: -19.4MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2025-02-07 21:42:44,757 INFO L158 Benchmark]: Boogie Preprocessor took 284.63ms. Allocated memory is still 302.0MB. Free memory was 153.9MB in the beginning and 94.0MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-07 21:42:44,757 INFO L158 Benchmark]: IcfgBuilder took 6920.06ms. Allocated memory was 302.0MB in the beginning and 612.4MB in the end (delta: 310.4MB). Free memory was 94.0MB in the beginning and 184.8MB in the end (delta: -90.8MB). Peak memory consumption was 333.9MB. Max. memory is 16.1GB. [2025-02-07 21:42:44,757 INFO L158 Benchmark]: TraceAbstraction took 6464.55ms. Allocated memory was 612.4MB in the beginning and 838.9MB in the end (delta: 226.5MB). Free memory was 184.8MB in the beginning and 652.0MB in the end (delta: -467.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:42:44,757 INFO L158 Benchmark]: Witness Printer took 472.50ms. Allocated memory is still 838.9MB. Free memory was 652.0MB in the beginning and 517.9MB in the end (delta: 134.1MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2025-02-07 21:42:44,759 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.15ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1922.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 71.5MB in the beginning and 134.5MB in the end (delta: -63.0MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 379.69ms. Allocated memory is still 302.0MB. Free memory was 134.5MB in the beginning and 153.9MB in the end (delta: -19.4MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 284.63ms. Allocated memory is still 302.0MB. Free memory was 153.9MB in the beginning and 94.0MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * IcfgBuilder took 6920.06ms. Allocated memory was 302.0MB in the beginning and 612.4MB in the end (delta: 310.4MB). Free memory was 94.0MB in the beginning and 184.8MB in the end (delta: -90.8MB). Peak memory consumption was 333.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6464.55ms. Allocated memory was 612.4MB in the beginning and 838.9MB in the end (delta: 226.5MB). Free memory was 184.8MB in the beginning and 652.0MB in the end (delta: -467.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 472.50ms. Allocated memory is still 838.9MB. Free memory was 652.0MB in the beginning and 517.9MB in the end (delta: 134.1MB). Peak memory consumption was 134.2MB. 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: 11028]: 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: 11173]: 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 7 procedures, 2175 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 3956 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1649 IncrementalHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 3956 mSDtfsCounter, 1649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2127occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3310 NumberOfCodeBlocks, 3310 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3308 ConstructedInterpolants, 0 QuantifiedInterpolants, 6614 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: 11150]: Location Invariant Derived location invariant: (18 <= a9) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:42:44,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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