./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races 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/pthread-divine/ring_2w1r-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37b8edad74269e9ff0decb0295cb9343b2467e698f16054f344bf342aab69b21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:29:15,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:29:15,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:29:15,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:29:15,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:29:15,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:29:15,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:29:15,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:29:15,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:29:15,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:29:15,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:29:15,873 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:29:15,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:15,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:29:15,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:29:15,875 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 ! data-race) ) 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 -> 37b8edad74269e9ff0decb0295cb9343b2467e698f16054f344bf342aab69b21 [2025-02-08 05:29:16,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:29:16,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:29:16,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:29:16,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:29:16,090 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:29:16,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2025-02-08 05:29:17,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8e05b4f2/6327ba1212834986a70c7c9f676271f9/FLAG9fa1bbda9 [2025-02-08 05:29:17,886 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:29:17,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2025-02-08 05:29:17,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8e05b4f2/6327ba1212834986a70c7c9f676271f9/FLAG9fa1bbda9 [2025-02-08 05:29:17,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8e05b4f2/6327ba1212834986a70c7c9f676271f9 [2025-02-08 05:29:17,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:29:17,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:29:17,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:17,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:29:17,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:29:17,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:17" (1/1) ... [2025-02-08 05:29:17,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:17, skipping insertion in model container [2025-02-08 05:29:17,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:17" (1/1) ... [2025-02-08 05:29:17,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:29:18,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:18,203 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:29:18,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:18,304 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:29:18,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18 WrapperNode [2025-02-08 05:29:18,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:18,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:18,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:29:18,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:29:18,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,360 INFO L138 Inliner]: procedures = 308, calls = 61, calls flagged for inlining = 17, calls inlined = 12, statements flattened = 317 [2025-02-08 05:29:18,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:18,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:29:18,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:29:18,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:29:18,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:29:18,404 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:29:18,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:29:18,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:29:18,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (1/1) ... [2025-02-08 05:29:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:29:18,437 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-08 05:29:18,440 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-08 05:29:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2025-02-08 05:29:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2025-02-08 05:29:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2025-02-08 05:29:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2025-02-08 05:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:29:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:29:18,462 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:29:18,577 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:29:18,579 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-2: assume false; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-2: assume !false; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-2: assume { :end_inline_ring_dequeue } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-3: assume false; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-3: havoc ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-4: assume false; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-4: assume !false; [2025-02-08 05:29:18,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-4: havoc ring_dequeue_#t~mem10#1, ring_dequeue_#t~mem11#1, ring_dequeue_#t~mem12#1, ring_dequeue_#t~nondet13#1, ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, ring_dequeue_~x~0#1; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-5: assume false; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-5: #t~ret27#1 := ring_dequeue_#res#1; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-6: assume false; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-6: assume !false; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-6: havoc ring_dequeue_#t~mem10#1, ring_dequeue_#t~mem11#1, ring_dequeue_#t~mem12#1, ring_dequeue_#t~nondet13#1, ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, ring_dequeue_~x~0#1; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-7: assume false; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-7: havoc ring_dequeue_#res#1; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-8: assume { :begin_inline_ring_dequeue } true;ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset := ~r~2#1.base, ~r~2#1.offset; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-1: assume !(~val~1#1 > 0); [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-1: assume !!(~val~1#1 > 0); [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: assume !(~val~1#1 <= 8); [2025-02-08 05:29:18,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: assume !!(~val~1#1 <= 8); [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset := ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062: havoc #t~nondet30#1; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-1: havoc #t~pre29#1; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume ((#race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] == #t~nondet30#1 && #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet30#1) && #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet30#1) && #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet30#1; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume !(((#race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] == #t~nondet30#1 && #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet30#1) && #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet30#1) && #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))] == #t~nondet30#1); [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-3: havoc #t~mem28#1; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-4: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := #t~nondet30#1]; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-5: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := #t~nondet30#1]; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-6: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := #t~nondet30#1]; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-7: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1) := #t~nondet30#1]; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-8: havoc #t~nondet30#1; [2025-02-08 05:29:18,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-9: SUMMARY for call write~int(1 + #t~mem28#1, ~#read~0#1.base, ~#read~0#1.offset + 4 * (~val~1#1 - 1), 4); srcloc: null [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-10: assume ((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-10: assume !(((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1)] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1))]); [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-11: #t~pre29#1 := 1 + #t~mem28#1; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-12: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-13: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-14: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * (~val~1#1 - 1)) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-15: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * (~val~1#1 - 1) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-16: SUMMARY for call #t~mem28#1 := read~int(~#read~0#1.base, ~#read~0#1.offset + 4 * (~val~1#1 - 1), 4); srcloc: null [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: havoc ring_dequeue_#t~mem11#1; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-1: havoc ring_dequeue_#t~mem10#1; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-2: assume ((0 == #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1] && 0 == #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-2: assume !(((0 == #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1] && 0 == #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]); [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-3: ring_dequeue_~x~0#1 := ring_dequeue_#t~mem11#1; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-4: #race := #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-5: #race := #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-6: #race := #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-7: #race := #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1 := 0]; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063: assume ~i~3#1 < ~val~1#1; [2025-02-08 05:29:18,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063: assume !(~i~3#1 < ~val~1#1); [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-8: SUMMARY for call ring_dequeue_#t~mem11#1 := read~int(ring_dequeue_~r#1.base, 4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1, 4); srcloc: null [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-1: havoc #t~pre33#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-9: assume ((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-9: assume !(((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]); [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-2: ~i~3#1 := 1 + ~i~3#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-10: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-3: #t~pre33#1 := 1 + ~i~3#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-11: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-4: havoc ~i~3#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-12: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-5: ~i~3#1 := 0; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-13: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-14: SUMMARY for call ring_dequeue_#t~mem10#1 := read~int(ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055: havoc ~#read~0#1.base, ~#read~0#1.offset; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-1: SUMMARY for call ULTIMATE.dealloc(~#read~0#1.base, ~#read~0#1.offset); srcloc: null [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: assume ((#race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1 && #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: assume !(((#race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1 && #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1); [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-2: havoc ring_dequeue_#t~mem12#1; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-3: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-4: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-5: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:18,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-6: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-7: havoc ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064: havoc #t~mem31#1; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-8: SUMMARY for call write~int((if 1 + ring_dequeue_#t~mem12#1 < 0 && 0 != (1 + ring_dequeue_#t~mem12#1) % 4 then (1 + ring_dequeue_#t~mem12#1) % 4 - 4 else (1 + ring_dequeue_#t~mem12#1) % 4), ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-1: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-9: assume ((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-9: assume !(((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]); [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-2: assume !(#t~mem31#1 <= 2); [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-2: assume !!(#t~mem31#1 <= 2); [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-10: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-11: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-4: assume ((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-4: assume !(((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]); [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-12: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-5: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-13: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-6: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-14: SUMMARY for call ring_dequeue_#t~mem12#1 := read~int(ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-7: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-8: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1 := 0]; [2025-02-08 05:29:18,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-9: SUMMARY for call #t~mem31#1 := read~int(~#read~0#1.base, ~#read~0#1.offset + 4 * ~i~3#1, 4); srcloc: null [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L817-1: ring_dequeue_#res#1 := ring_dequeue_~x~0#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065: havoc #t~mem32#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-1: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-2: assume !(#t~mem32#1 > 0); [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-2: assume !!(#t~mem32#1 > 0); [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-4: assume ((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-4: assume !(((0 == #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1] && 0 == #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1)]) && 0 == #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1)]); [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-5: #race := #race[~#read~0#1.base,3 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-6: #race := #race[~#read~0#1.base,2 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-7: #race := #race[~#read~0#1.base,1 + (~#read~0#1.offset + 4 * ~i~3#1) := 0]; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-8: #race := #race[~#read~0#1.base,~#read~0#1.offset + 4 * ~i~3#1 := 0]; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057: assume 0 != #t~ret26#1 % 256; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057: assume !(0 != #t~ret26#1 % 256); [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-9: SUMMARY for call #t~mem32#1 := read~int(~#read~0#1.base, ~#read~0#1.offset + 4 * ~i~3#1, 4); srcloc: null [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-1: havoc #t~ret26#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-2: havoc #t~ret26#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-3: havoc ring_empty_#in~r#1.base, ring_empty_#in~r#1.offset;assume { :end_inline_ring_empty } true; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-4: havoc ring_empty_#t~mem14#1, ring_empty_#t~mem15#1, ring_empty_~r#1.base, ring_empty_~r#1.offset; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057-5: #t~ret26#1 := ring_empty_#res#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067: havoc #t~pre34#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-1: ~i~2#1 := 1 + ~i~2#1; [2025-02-08 05:29:18,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-2: #t~pre34#1 := 1 + ~i~2#1; [2025-02-08 05:29:18,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume false; [2025-02-08 05:29:18,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803: assume !false; [2025-02-08 05:29:18,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: havoc #t~ret27#1; [2025-02-08 05:29:18,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-1: assume false; [2025-02-08 05:29:18,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-1: ~val~1#1 := #t~ret27#1; [2025-02-08 05:29:19,244 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:29:19,245 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:29:19,260 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:29:19,262 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:29:19,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:19 BoogieIcfgContainer [2025-02-08 05:29:19,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:29:19,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:29:19,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:29:19,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:29:19,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:29:17" (1/3) ... [2025-02-08 05:29:19,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f8fac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:19, skipping insertion in model container [2025-02-08 05:29:19,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:18" (2/3) ... [2025-02-08 05:29:19,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f8fac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:19, skipping insertion in model container [2025-02-08 05:29:19,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:19" (3/3) ... [2025-02-08 05:29:19,276 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2025-02-08 05:29:19,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:29:19,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_2w1r-2.i that has 3 procedures, 250 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-02-08 05:29:19,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:29:19,351 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:29:19,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 255 transitions, 524 flow [2025-02-08 05:29:19,463 INFO L124 PetriNetUnfolderBase]: 6/253 cut-off events. [2025-02-08 05:29:19,466 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:29:19,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 6/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 717 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 203. Up to 2 conditions per place. [2025-02-08 05:29:19,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 255 transitions, 524 flow [2025-02-08 05:29:19,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 247 transitions, 503 flow [2025-02-08 05:29:19,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:29:19,487 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;@63ba5bef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:29:19,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 05:29:19,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:29:19,502 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:29:19,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:29:19,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:19,503 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:19,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:19,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1901113949, now seen corresponding path program 1 times [2025-02-08 05:29:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:19,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816682630] [2025-02-08 05:29:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:19,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:29:19,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:29:19,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:19,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816682630] [2025-02-08 05:29:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816682630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:20,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:20,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66203123] [2025-02-08 05:29:20,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:20,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:20,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:20,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 255 [2025-02-08 05:29:20,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 247 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:20,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:20,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 255 [2025-02-08 05:29:20,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:23,983 INFO L124 PetriNetUnfolderBase]: 11134/31589 cut-off events. [2025-02-08 05:29:23,983 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-08 05:29:24,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48334 conditions, 31589 events. 11134/31589 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 346233 event pairs, 10208 based on Foata normal form. 1112/30203 useless extension candidates. Maximal degree in co-relation 48031. Up to 16668 conditions per place. [2025-02-08 05:29:24,146 INFO L140 encePairwiseOnDemand]: 247/255 looper letters, 64 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2025-02-08 05:29:24,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 244 transitions, 635 flow [2025-02-08 05:29:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1164 transitions. [2025-02-08 05:29:24,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7607843137254902 [2025-02-08 05:29:24,160 INFO L175 Difference]: Start difference. First operand has 248 places, 247 transitions, 503 flow. Second operand 6 states and 1164 transitions. [2025-02-08 05:29:24,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 244 transitions, 635 flow [2025-02-08 05:29:24,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 244 transitions, 630 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:29:24,172 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 502 flow [2025-02-08 05:29:24,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-02-08 05:29:24,177 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 1 predicate places. [2025-02-08 05:29:24,177 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 502 flow [2025-02-08 05:29:24,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:24,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:24,178 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:29:24,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 778700398, now seen corresponding path program 1 times [2025-02-08 05:29:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517663371] [2025-02-08 05:29:24,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:24,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:29:24,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:29:24,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:24,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517663371] [2025-02-08 05:29:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517663371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:24,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527978497] [2025-02-08 05:29:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:24,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:24,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:24,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 255 [2025-02-08 05:29:24,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:24,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:24,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 255 [2025-02-08 05:29:24,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:27,857 INFO L124 PetriNetUnfolderBase]: 11134/31588 cut-off events. [2025-02-08 05:29:27,857 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 05:29:27,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48287 conditions, 31588 events. 11134/31588 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 346275 event pairs, 10208 based on Foata normal form. 0/29091 useless extension candidates. Maximal degree in co-relation 48235. Up to 16668 conditions per place. [2025-02-08 05:29:28,018 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 64 selfloop transitions, 5 changer transitions 0/243 dead transitions. [2025-02-08 05:29:28,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 243 transitions, 638 flow [2025-02-08 05:29:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2025-02-08 05:29:28,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7594771241830065 [2025-02-08 05:29:28,022 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 502 flow. Second operand 6 states and 1162 transitions. [2025-02-08 05:29:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 243 transitions, 638 flow [2025-02-08 05:29:28,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 243 transitions, 628 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:29:28,025 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 500 flow [2025-02-08 05:29:28,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2025-02-08 05:29:28,026 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 0 predicate places. [2025-02-08 05:29:28,026 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 500 flow [2025-02-08 05:29:28,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:28,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:28,027 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:28,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:29:28,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting writer_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:28,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 812899084, now seen corresponding path program 1 times [2025-02-08 05:29:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:28,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904181979] [2025-02-08 05:29:28,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:28,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:29:28,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:29:28,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:28,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904181979] [2025-02-08 05:29:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904181979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036722340] [2025-02-08 05:29:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:28,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:28,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:28,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:28,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:29,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-02-08 05:29:29,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:29,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:29,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-02-08 05:29:29,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:29,391 INFO L124 PetriNetUnfolderBase]: 577/3215 cut-off events. [2025-02-08 05:29:29,391 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-08 05:29:29,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 3215 events. 577/3215 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 25873 event pairs, 111 based on Foata normal form. 0/2886 useless extension candidates. Maximal degree in co-relation 4228. Up to 755 conditions per place. [2025-02-08 05:29:29,408 INFO L140 encePairwiseOnDemand]: 227/255 looper letters, 58 selfloop transitions, 49 changer transitions 0/301 dead transitions. [2025-02-08 05:29:29,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 301 transitions, 834 flow [2025-02-08 05:29:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2025-02-08 05:29:29,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679738562091504 [2025-02-08 05:29:29,411 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 500 flow. Second operand 6 states and 1328 transitions. [2025-02-08 05:29:29,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 301 transitions, 834 flow [2025-02-08 05:29:29,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 301 transitions, 824 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:29:29,421 INFO L231 Difference]: Finished difference. Result has 253 places, 291 transitions, 836 flow [2025-02-08 05:29:29,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=836, PETRI_PLACES=253, PETRI_TRANSITIONS=291} [2025-02-08 05:29:29,422 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 5 predicate places. [2025-02-08 05:29:29,422 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 291 transitions, 836 flow [2025-02-08 05:29:29,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:29,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:29,423 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:29,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:29:29,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr9ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:29,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -456237300, now seen corresponding path program 1 times [2025-02-08 05:29:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519868294] [2025-02-08 05:29:29,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:29,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:29:29,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:29:29,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:29,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519868294] [2025-02-08 05:29:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519868294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892453367] [2025-02-08 05:29:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:29,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:29,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:29,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:29,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:30,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 255 [2025-02-08 05:29:30,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 291 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:30,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:30,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 255 [2025-02-08 05:29:30,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:32,619 INFO L124 PetriNetUnfolderBase]: 6633/26841 cut-off events. [2025-02-08 05:29:32,619 INFO L125 PetriNetUnfolderBase]: For 8811/9334 co-relation queries the response was YES. [2025-02-08 05:29:32,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46567 conditions, 26841 events. 6633/26841 cut-off events. For 8811/9334 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 325066 event pairs, 921 based on Foata normal form. 50/24206 useless extension candidates. Maximal degree in co-relation 42015. Up to 7071 conditions per place. [2025-02-08 05:29:32,758 INFO L140 encePairwiseOnDemand]: 233/255 looper letters, 72 selfloop transitions, 205 changer transitions 0/499 dead transitions. [2025-02-08 05:29:32,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 499 transitions, 2438 flow [2025-02-08 05:29:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1410 transitions. [2025-02-08 05:29:32,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2025-02-08 05:29:32,761 INFO L175 Difference]: Start difference. First operand has 253 places, 291 transitions, 836 flow. Second operand 6 states and 1410 transitions. [2025-02-08 05:29:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 499 transitions, 2438 flow [2025-02-08 05:29:32,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 499 transitions, 2438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:32,785 INFO L231 Difference]: Finished difference. Result has 263 places, 495 transitions, 2798 flow [2025-02-08 05:29:32,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2798, PETRI_PLACES=263, PETRI_TRANSITIONS=495} [2025-02-08 05:29:32,786 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 15 predicate places. [2025-02-08 05:29:32,786 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 495 transitions, 2798 flow [2025-02-08 05:29:32,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:32,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:32,787 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:32,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:29:32,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:32,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1451527752, now seen corresponding path program 1 times [2025-02-08 05:29:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:32,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404074948] [2025-02-08 05:29:32,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:32,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:32,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:29:32,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:29:32,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:32,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404074948] [2025-02-08 05:29:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404074948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93770946] [2025-02-08 05:29:33,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:33,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:33,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-02-08 05:29:33,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 495 transitions, 2798 flow. Second operand has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:33,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:33,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-02-08 05:29:33,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:37,352 INFO L124 PetriNetUnfolderBase]: 9610/34331 cut-off events. [2025-02-08 05:29:37,353 INFO L125 PetriNetUnfolderBase]: For 42462/46444 co-relation queries the response was YES. [2025-02-08 05:29:37,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79744 conditions, 34331 events. 9610/34331 cut-off events. For 42462/46444 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 434813 event pairs, 692 based on Foata normal form. 1343/32989 useless extension candidates. Maximal degree in co-relation 79670. Up to 10599 conditions per place. [2025-02-08 05:29:37,572 INFO L140 encePairwiseOnDemand]: 227/255 looper letters, 288 selfloop transitions, 265 changer transitions 0/765 dead transitions. [2025-02-08 05:29:37,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 765 transitions, 5764 flow [2025-02-08 05:29:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1324 transitions. [2025-02-08 05:29:37,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865359477124183 [2025-02-08 05:29:37,576 INFO L175 Difference]: Start difference. First operand has 263 places, 495 transitions, 2798 flow. Second operand 6 states and 1324 transitions. [2025-02-08 05:29:37,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 765 transitions, 5764 flow [2025-02-08 05:29:37,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 765 transitions, 5764 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:37,648 INFO L231 Difference]: Finished difference. Result has 273 places, 759 transitions, 5940 flow [2025-02-08 05:29:37,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=2798, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5940, PETRI_PLACES=273, PETRI_TRANSITIONS=759} [2025-02-08 05:29:37,650 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 25 predicate places. [2025-02-08 05:29:37,650 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 759 transitions, 5940 flow [2025-02-08 05:29:37,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:37,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:37,652 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:29:37,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting writer_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:37,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash -439609454, now seen corresponding path program 1 times [2025-02-08 05:29:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251937019] [2025-02-08 05:29:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:37,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:29:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:29:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251937019] [2025-02-08 05:29:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251937019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605859357] [2025-02-08 05:29:37,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:37,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:37,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:38,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 255 [2025-02-08 05:29:38,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 759 transitions, 5940 flow. Second operand has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:38,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:38,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 255 [2025-02-08 05:29:38,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:43,463 INFO L124 PetriNetUnfolderBase]: 11977/41613 cut-off events. [2025-02-08 05:29:43,464 INFO L125 PetriNetUnfolderBase]: For 105637/118009 co-relation queries the response was YES. [2025-02-08 05:29:43,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111508 conditions, 41613 events. 11977/41613 cut-off events. For 105637/118009 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 531092 event pairs, 522 based on Foata normal form. 3433/42037 useless extension candidates. Maximal degree in co-relation 111429. Up to 11517 conditions per place. [2025-02-08 05:29:43,766 INFO L140 encePairwiseOnDemand]: 240/255 looper letters, 402 selfloop transitions, 510 changer transitions 0/1276 dead transitions. [2025-02-08 05:29:43,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1276 transitions, 12930 flow [2025-02-08 05:29:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-02-08 05:29:43,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2025-02-08 05:29:43,779 INFO L175 Difference]: Start difference. First operand has 273 places, 759 transitions, 5940 flow. Second operand 6 states and 1398 transitions. [2025-02-08 05:29:43,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1276 transitions, 12930 flow [2025-02-08 05:29:43,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1276 transitions, 12930 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:43,921 INFO L231 Difference]: Finished difference. Result has 283 places, 1269 transitions, 13610 flow [2025-02-08 05:29:43,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=5940, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13610, PETRI_PLACES=283, PETRI_TRANSITIONS=1269} [2025-02-08 05:29:43,922 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 35 predicate places. [2025-02-08 05:29:43,922 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 1269 transitions, 13610 flow [2025-02-08 05:29:43,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:43,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:43,923 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:43,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:29:43,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr8ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:43,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash -501018289, now seen corresponding path program 1 times [2025-02-08 05:29:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:43,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97559828] [2025-02-08 05:29:43,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:43,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:29:43,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:29:43,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:44,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97559828] [2025-02-08 05:29:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97559828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:44,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:44,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:44,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102405022] [2025-02-08 05:29:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:44,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:44,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:44,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:44,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 255 [2025-02-08 05:29:44,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1269 transitions, 13610 flow. Second operand has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:44,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:44,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 255 [2025-02-08 05:29:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:56,935 INFO L124 PetriNetUnfolderBase]: 31138/89687 cut-off events. [2025-02-08 05:29:56,936 INFO L125 PetriNetUnfolderBase]: For 416372/445058 co-relation queries the response was YES. [2025-02-08 05:29:57,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285893 conditions, 89687 events. 31138/89687 cut-off events. For 416372/445058 co-relation queries the response was YES. Maximal size of possible extension queue 1822. Compared 1151754 event pairs, 1570 based on Foata normal form. 11630/94774 useless extension candidates. Maximal degree in co-relation 273059. Up to 30553 conditions per place. [2025-02-08 05:29:57,687 INFO L140 encePairwiseOnDemand]: 233/255 looper letters, 1027 selfloop transitions, 1613 changer transitions 0/2885 dead transitions. [2025-02-08 05:29:57,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 2885 transitions, 38474 flow [2025-02-08 05:29:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1410 transitions. [2025-02-08 05:29:57,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2025-02-08 05:29:57,692 INFO L175 Difference]: Start difference. First operand has 283 places, 1269 transitions, 13610 flow. Second operand 6 states and 1410 transitions. [2025-02-08 05:29:57,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 2885 transitions, 38474 flow [2025-02-08 05:29:58,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 2885 transitions, 38474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:58,059 INFO L231 Difference]: Finished difference. Result has 293 places, 2881 transitions, 40444 flow [2025-02-08 05:29:58,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=13610, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=403, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=40444, PETRI_PLACES=293, PETRI_TRANSITIONS=2881} [2025-02-08 05:29:58,062 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, 45 predicate places. [2025-02-08 05:29:58,063 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 2881 transitions, 40444 flow [2025-02-08 05:29:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:58,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:58,064 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-08 05:29:58,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:29:58,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [reader_twoErr9ASSERT_VIOLATIONDATA_RACE, reader_twoErr8ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:29:58,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1125771477, now seen corresponding path program 1 times [2025-02-08 05:29:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:58,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216201965] [2025-02-08 05:29:58,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:58,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:58,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:29:58,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:29:58,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:58,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:58,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216201965] [2025-02-08 05:29:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216201965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11168051] [2025-02-08 05:29:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:58,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:58,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:58,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 255 [2025-02-08 05:29:58,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 2881 transitions, 40444 flow. Second operand has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:58,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:58,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 255 [2025-02-08 05:29:58,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand