./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/qw2004_variant.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-lit/qw2004_variant.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 1ad14026eba5b252f16e1e7c5b06294a08c72d8fedf1d2cbda596d8ea988add3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:26:36,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:26:36,167 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:26:36,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:26:36,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:26:36,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:26:36,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:26:36,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:26:36,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:26:36,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:26:36,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:26:36,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:26:36,202 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:26:36,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:26:36,203 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:26:36,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:26:36,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:36,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:26:36,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:26:36,205 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 -> 1ad14026eba5b252f16e1e7c5b06294a08c72d8fedf1d2cbda596d8ea988add3 [2025-02-08 05:26:36,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:26:36,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:26:36,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:26:36,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:26:36,498 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:26:36,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004_variant.i [2025-02-08 05:26:37,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/671f49c1d/456f0ec82c4f4397bb65ef7354a91de0/FLAG37f621bfc [2025-02-08 05:26:38,259 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:26:38,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004_variant.i [2025-02-08 05:26:38,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/671f49c1d/456f0ec82c4f4397bb65ef7354a91de0/FLAG37f621bfc [2025-02-08 05:26:38,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/671f49c1d/456f0ec82c4f4397bb65ef7354a91de0 [2025-02-08 05:26:38,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:26:38,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:26:38,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:38,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:26:38,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:26:38,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d7a2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38, skipping insertion in model container [2025-02-08 05:26:38,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:26:38,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:38,646 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:26:38,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:38,719 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:26:38,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38 WrapperNode [2025-02-08 05:26:38,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:38,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:38,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:26:38,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:26:38,726 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:26:38" (1/1) ... [2025-02-08 05:26:38,737 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:26:38" (1/1) ... [2025-02-08 05:26:38,754 INFO L138 Inliner]: procedures = 173, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-02-08 05:26:38,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:38,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:26:38,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:26:38,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:26:38,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:26:38,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:26:38,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:26:38,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:26:38,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:38,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:26:38,812 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:26:38,815 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:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-02-08 05:26:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-02-08 05:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpAdd [2025-02-08 05:26:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpAdd [2025-02-08 05:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:26:38,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:26:38,838 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:26:38,955 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:26:38,957 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:26:39,153 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: havoc BCSP_IoDecrement_#t~post4#1, BCSP_IoDecrement_#t~nondet5#1, BCSP_IoDecrement_#t~nondet6#1;assume { :end_inline_BCSP_IoDecrement } true; [2025-02-08 05:26:39,153 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #race~pendingIo~0 := 0; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L718: [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: havoc BCSP_IoDecrement_#t~nondet5#1; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume #race~pendingIo~0 == BCSP_IoDecrement_#t~nondet5#1; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(#race~pendingIo~0 == BCSP_IoDecrement_#t~nondet5#1); [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: havoc BCSP_IoDecrement_#t~post4#1; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-3: #race~pendingIo~0 := BCSP_IoDecrement_#t~nondet5#1; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: havoc BCSP_IoDecrement_#t~nondet5#1; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-5: ~pendingIo~0 := BCSP_IoDecrement_#t~post4#1 - 1; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume 0 == #race~pendingIo~0; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume !(0 == #race~pendingIo~0); [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-7: BCSP_IoDecrement_#t~post4#1 := ~pendingIo~0; [2025-02-08 05:26:39,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume 0 == ~pendingIo~0; [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume !(0 == ~pendingIo~0); [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: assume 0 == #race~pendingIo~0; [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: assume !(0 == #race~pendingIo~0); [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-2: #race~pendingIo~0 := 0; [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline_BCSP_IoDecrement } true;havoc BCSP_IoDecrement_#t~post4#1, BCSP_IoDecrement_#t~nondet5#1, BCSP_IoDecrement_#t~nondet6#1; [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-1: havoc __VERIFIER_assert_#in~cond#1; [2025-02-08 05:26:39,155 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-2: havoc __VERIFIER_assert_~cond#1; [2025-02-08 05:26:39,156 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: assume #race~stoppingEvent~0 == BCSP_IoDecrement_#t~nondet6#1; [2025-02-08 05:26:39,156 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: assume !(#race~stoppingEvent~0 == BCSP_IoDecrement_#t~nondet6#1); [2025-02-08 05:26:39,156 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-1: havoc BCSP_IoDecrement_#t~nondet6#1; [2025-02-08 05:26:39,156 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-2: #race~stoppingEvent~0 := BCSP_IoDecrement_#t~nondet6#1; [2025-02-08 05:26:39,156 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-3: havoc BCSP_IoDecrement_#t~nondet6#1; [2025-02-08 05:26:39,156 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-4: ~stoppingEvent~0 := 1; [2025-02-08 05:26:39,222 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:26:39,223 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:26:39,309 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:26:39,309 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:26:39,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:39 BoogieIcfgContainer [2025-02-08 05:26:39,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:26:39,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:26:39,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:26:39,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:26:39,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:26:38" (1/3) ... [2025-02-08 05:26:39,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e992f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:39, skipping insertion in model container [2025-02-08 05:26:39,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (2/3) ... [2025-02-08 05:26:39,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e992f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:39, skipping insertion in model container [2025-02-08 05:26:39,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:39" (3/3) ... [2025-02-08 05:26:39,321 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004_variant.i [2025-02-08 05:26:39,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:26:39,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004_variant.i that has 3 procedures, 126 locations, 1 initial locations, 1 loop locations, and 19 error locations. [2025-02-08 05:26:39,337 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:26:39,401 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:39,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 129 transitions, 266 flow [2025-02-08 05:26:39,506 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2025-02-08 05:26:39,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:39,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2025-02-08 05:26:39,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 129 transitions, 266 flow [2025-02-08 05:26:39,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 128 transitions, 263 flow [2025-02-08 05:26:39,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:39,540 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;@61ca7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:39,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 05:26:39,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:39,546 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-02-08 05:26:39,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:39,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:39,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:39,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 68044856, now seen corresponding path program 1 times [2025-02-08 05:26:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128033680] [2025-02-08 05:26:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:39,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 05:26:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 05:26:39,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:39,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:39,738 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:26:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128033680] [2025-02-08 05:26:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128033680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090964224] [2025-02-08 05:26:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:39,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:39,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:39,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:39,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-02-08 05:26:39,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:26:39,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:39,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-02-08 05:26:39,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:39,915 INFO L124 PetriNetUnfolderBase]: 11/226 cut-off events. [2025-02-08 05:26:39,915 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:26:39,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 226 events. 11/226 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 764 event pairs, 11 based on Foata normal form. 15/211 useless extension candidates. Maximal degree in co-relation 215. Up to 31 conditions per place. [2025-02-08 05:26:39,919 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 9 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-02-08 05:26:39,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 115 transitions, 259 flow [2025-02-08 05:26:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-02-08 05:26:39,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8785529715762274 [2025-02-08 05:26:39,936 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 263 flow. Second operand 3 states and 340 transitions. [2025-02-08 05:26:39,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 115 transitions, 259 flow [2025-02-08 05:26:39,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 115 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:39,946 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 240 flow [2025-02-08 05:26:39,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-02-08 05:26:39,955 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -9 predicate places. [2025-02-08 05:26:39,955 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 240 flow [2025-02-08 05:26:39,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:26:39,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:39,956 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] [2025-02-08 05:26:39,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:26:39,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:39,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1577461824, now seen corresponding path program 1 times [2025-02-08 05:26:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805552551] [2025-02-08 05:26:39,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:39,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:26:39,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:26:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,045 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:26:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805552551] [2025-02-08 05:26:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805552551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927811730] [2025-02-08 05:26:40,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 129 [2025-02-08 05:26:40,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:26:40,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 129 [2025-02-08 05:26:40,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,143 INFO L124 PetriNetUnfolderBase]: 20/337 cut-off events. [2025-02-08 05:26:40,144 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:26:40,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 337 events. 20/337 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1587 event pairs, 20 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 374. Up to 48 conditions per place. [2025-02-08 05:26:40,147 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 10 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-02-08 05:26:40,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 262 flow [2025-02-08 05:26:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2025-02-08 05:26:40,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475452196382429 [2025-02-08 05:26:40,149 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 240 flow. Second operand 3 states and 328 transitions. [2025-02-08 05:26:40,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 262 flow [2025-02-08 05:26:40,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 114 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,153 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 238 flow [2025-02-08 05:26:40,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2025-02-08 05:26:40,154 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -10 predicate places. [2025-02-08 05:26:40,154 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 238 flow [2025-02-08 05:26:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:26:40,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,154 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:26:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:26:40,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash -332716789, now seen corresponding path program 1 times [2025-02-08 05:26:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371290116] [2025-02-08 05:26:40,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:26:40,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:26:40,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,226 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:26:40,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371290116] [2025-02-08 05:26:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371290116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159759118] [2025-02-08 05:26:40,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 129 [2025-02-08 05:26:40,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:26:40,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 129 [2025-02-08 05:26:40,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,307 INFO L124 PetriNetUnfolderBase]: 20/301 cut-off events. [2025-02-08 05:26:40,307 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:26:40,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 301 events. 20/301 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1267 event pairs, 20 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 333. Up to 48 conditions per place. [2025-02-08 05:26:40,310 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 10 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-02-08 05:26:40,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 260 flow [2025-02-08 05:26:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2025-02-08 05:26:40,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475452196382429 [2025-02-08 05:26:40,314 INFO L175 Difference]: Start difference. First operand has 121 places, 114 transitions, 238 flow. Second operand 3 states and 328 transitions. [2025-02-08 05:26:40,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 260 flow [2025-02-08 05:26:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 113 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,319 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 236 flow [2025-02-08 05:26:40,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2025-02-08 05:26:40,321 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -11 predicate places. [2025-02-08 05:26:40,321 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 236 flow [2025-02-08 05:26:40,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:26:40,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,321 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] [2025-02-08 05:26:40,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:26:40,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:40,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1038104308, now seen corresponding path program 1 times [2025-02-08 05:26:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657318117] [2025-02-08 05:26:40,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:26:40,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:26:40,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,383 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:26:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657318117] [2025-02-08 05:26:40,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657318117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426296244] [2025-02-08 05:26:40,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-08 05:26:40,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:26:40,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-08 05:26:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,490 INFO L124 PetriNetUnfolderBase]: 27/307 cut-off events. [2025-02-08 05:26:40,491 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:26:40,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 307 events. 27/307 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1301 event pairs, 27 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 347. Up to 61 conditions per place. [2025-02-08 05:26:40,493 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 11 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-02-08 05:26:40,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 112 transitions, 260 flow [2025-02-08 05:26:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2025-02-08 05:26:40,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8423772609819121 [2025-02-08 05:26:40,495 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 236 flow. Second operand 3 states and 326 transitions. [2025-02-08 05:26:40,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 112 transitions, 260 flow [2025-02-08 05:26:40,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,499 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 234 flow [2025-02-08 05:26:40,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-02-08 05:26:40,500 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -12 predicate places. [2025-02-08 05:26:40,500 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 234 flow [2025-02-08 05:26:40,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:26:40,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,500 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] [2025-02-08 05:26:40,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:26:40,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:40,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1340023046, now seen corresponding path program 1 times [2025-02-08 05:26:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765659724] [2025-02-08 05:26:40,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:26:40,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:26:40,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,570 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:26:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765659724] [2025-02-08 05:26:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765659724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744036568] [2025-02-08 05:26:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2025-02-08 05:26:40,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:26:40,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2025-02-08 05:26:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,639 INFO L124 PetriNetUnfolderBase]: 15/258 cut-off events. [2025-02-08 05:26:40,639 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:26:40,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 258 events. 15/258 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1072 event pairs, 9 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 283. Up to 35 conditions per place. [2025-02-08 05:26:40,641 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 11 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2025-02-08 05:26:40,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 279 flow [2025-02-08 05:26:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-02-08 05:26:40,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733850129198967 [2025-02-08 05:26:40,643 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 234 flow. Second operand 3 states and 338 transitions. [2025-02-08 05:26:40,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 279 flow [2025-02-08 05:26:40,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,648 INFO L231 Difference]: Finished difference. Result has 121 places, 116 transitions, 268 flow [2025-02-08 05:26:40,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=121, PETRI_TRANSITIONS=116} [2025-02-08 05:26:40,650 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -10 predicate places. [2025-02-08 05:26:40,650 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 116 transitions, 268 flow [2025-02-08 05:26:40,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:26:40,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,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] [2025-02-08 05:26:40,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:26:40,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:40,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1370639299, now seen corresponding path program 1 times [2025-02-08 05:26:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994598703] [2025-02-08 05:26:40,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:26:40,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:26:40,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,723 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:26:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994598703] [2025-02-08 05:26:40,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994598703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127629537] [2025-02-08 05:26:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 129 [2025-02-08 05:26:40,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 116 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:26:40,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 129 [2025-02-08 05:26:40,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,771 INFO L124 PetriNetUnfolderBase]: 15/265 cut-off events. [2025-02-08 05:26:40,772 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:26:40,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 265 events. 15/265 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1135 event pairs, 5 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 306. Up to 22 conditions per place. [2025-02-08 05:26:40,773 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 12 selfloop transitions, 1 changer transitions 0/118 dead transitions. [2025-02-08 05:26:40,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 305 flow [2025-02-08 05:26:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2025-02-08 05:26:40,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-02-08 05:26:40,775 INFO L175 Difference]: Start difference. First operand has 121 places, 116 transitions, 268 flow. Second operand 3 states and 339 transitions. [2025-02-08 05:26:40,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 305 flow [2025-02-08 05:26:40,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,778 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 258 flow [2025-02-08 05:26:40,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2025-02-08 05:26:40,779 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -11 predicate places. [2025-02-08 05:26:40,779 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 258 flow [2025-02-08 05:26:40,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:26:40,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,780 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] [2025-02-08 05:26:40,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:26:40,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:26:40,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 470667251, now seen corresponding path program 1 times [2025-02-08 05:26:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280167746] [2025-02-08 05:26:40,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:26:40,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:26:40,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:40,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:40,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:26:40,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:26:40,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:40,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:40,843 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:40,843 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2025-02-08 05:26:40,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-02-08 05:26:40,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-02-08 05:26:40,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-02-08 05:26:40,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-02-08 05:26:40,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-02-08 05:26:40,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-02-08 05:26:40,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-02-08 05:26:40,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-02-08 05:26:40,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-02-08 05:26:40,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-02-08 05:26:40,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-02-08 05:26:40,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-02-08 05:26:40,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-02-08 05:26:40,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:26:40,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:40,901 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:26:40,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:26:40,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:26:40 BasicIcfg [2025-02-08 05:26:40,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:26:40,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:26:40,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:26:40,909 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:26:40,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:39" (3/4) ... [2025-02-08 05:26:40,912 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:26:40,998 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-02-08 05:26:41,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:26:41,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:26:41,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:26:41,052 INFO L158 Benchmark]: Toolchain (without parser) took 2747.73ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 107.9MB in the end (delta: 2.4MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-02-08 05:26:41,052 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:41,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.02ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 90.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:26:41,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.51ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:26:41,054 INFO L158 Benchmark]: Boogie Preprocessor took 17.68ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.5MB in the end (delta: 874.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:41,054 INFO L158 Benchmark]: IcfgBuilder took 536.27ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 65.6MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:26:41,055 INFO L158 Benchmark]: TraceAbstraction took 1596.27ms. Allocated memory is still 142.6MB. Free memory was 65.0MB in the beginning and 57.2MB in the end (delta: 7.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-02-08 05:26:41,055 INFO L158 Benchmark]: Witness Printer took 142.13ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 107.9MB in the end (delta: -50.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2025-02-08 05:26:41,056 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.02ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 90.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.51ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.68ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.5MB in the end (delta: 874.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 536.27ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 65.6MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1596.27ms. Allocated memory is still 142.6MB. Free memory was 65.0MB in the beginning and 57.2MB in the end (delta: 7.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Witness Printer took 142.13ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 107.9MB in the end (delta: -50.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 730]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int stoppingFlag; VAL [stoppingFlag=0] [L698] 0 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L699] 0 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L700] 0 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L737] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L738] 0 int i; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L739] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L740] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L741] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L742] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L743] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L730] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L744] 0 i = 0 VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, t=-1] [L744] COND TRUE 0 i < 10 VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, t=-1] [L745] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpAdd, 0) VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, t=0] [L721] 2 int status; VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L722] CALL 2 BCSP_IoIncrement() [L703] 2 \read(stoppingFlag) [L703] 2 \read(stoppingFlag) [L703] COND TRUE 2 \read(stoppingFlag) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L730] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] Now there is a data race on ~stoppingFlag~0 between C: if (stoppingFlag) { __VERIFIER_atomic_end(); return -1; } else { pendingIo = pendingIo + 1; } [703-708] and C: stoppingFlag = 1 [730] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 194 locations, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 10 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:26:41,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)