./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 fa6fa0a79fa99d4fea06c7e1ebc83b26a613fddb13b3e8e80ca593044d78c841 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:12:03,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:12:03,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:12:03,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:12:03,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:12:04,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:12:04,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:12:04,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:12:04,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:12:04,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:12:04,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:12:04,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:12:04,017 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:12:04,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:12:04,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:12:04,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:04,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:04,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:04,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:12:04,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:12:04,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:12:04,021 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/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 -> fa6fa0a79fa99d4fea06c7e1ebc83b26a613fddb13b3e8e80ca593044d78c841 [2025-04-29 11:12:04,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:12:04,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:12:04,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:12:04,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:12:04,248 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:12:04,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.c [2025-04-29 11:12:05,543 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24efc63e4/a6a2ac46849847fca38b2f627b126dfc/FLAG8a62f9357 [2025-04-29 11:12:05,768 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:12:05,768 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.c [2025-04-29 11:12:05,769 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:05,769 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:05,782 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24efc63e4/a6a2ac46849847fca38b2f627b126dfc/FLAG8a62f9357 [2025-04-29 11:12:06,543 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24efc63e4/a6a2ac46849847fca38b2f627b126dfc [2025-04-29 11:12:06,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:12:06,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:12:06,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:06,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:12:06,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:12:06,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5587b15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06, skipping insertion in model container [2025-04-29 11:12:06,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:12:06,719 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:06,726 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:12:06,755 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:06,764 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:12:06,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06 WrapperNode [2025-04-29 11:12:06,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:06,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:06,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:12:06,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:12:06,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,790 INFO L138 Inliner]: procedures = 15, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-04-29 11:12:06,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:06,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:12:06,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:12:06,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:12:06,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:12:06,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:12:06,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:12:06,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:12:06,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (1/1) ... [2025-04-29 11:12:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:12:06,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:12:06,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:12:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:12:06,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:12:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:12:06,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:12:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:12:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:12:06,860 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:12:06,919 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:12:06,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:12:07,056 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:12:07,056 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:12:07,070 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:12:07,072 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:12:07,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:07 BoogieIcfgContainer [2025-04-29 11:12:07,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:12:07,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:12:07,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:12:07,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:12:07,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:12:06" (1/3) ... [2025-04-29 11:12:07,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286c2798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:07, skipping insertion in model container [2025-04-29 11:12:07,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:06" (2/3) ... [2025-04-29 11:12:07,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286c2798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:07, skipping insertion in model container [2025-04-29 11:12:07,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:07" (3/3) ... [2025-04-29 11:12:07,080 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.c [2025-04-29 11:12:07,090 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:12:07,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic.c that has 2 procedures, 83 locations, 84 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:12:07,092 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:12:07,131 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:12:07,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 177 flow [2025-04-29 11:12:07,192 INFO L116 PetriNetUnfolderBase]: 2/117 cut-off events. [2025-04-29 11:12:07,195 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:12:07,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 117 events. 2/117 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 56. Up to 3 conditions per place. [2025-04-29 11:12:07,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 177 flow [2025-04-29 11:12:07,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 177 flow [2025-04-29 11:12:07,205 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:07,212 INFO L340 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;@685644a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:07,212 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:12:07,222 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:07,225 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:12:07,225 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:07,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:07,225 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] [2025-04-29 11:12:07,226 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:12:07,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash 958200713, now seen corresponding path program 1 times [2025-04-29 11:12:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:07,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823973899] [2025-04-29 11:12:07,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:07,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:07,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:07,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:07,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:07,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823973899] [2025-04-29 11:12:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823973899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:07,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:07,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073909112] [2025-04-29 11:12:07,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:07,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:07,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:07,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:07,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 85 [2025-04-29 11:12:07,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-04-29 11:12:07,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:07,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 85 [2025-04-29 11:12:07,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:07,443 INFO L116 PetriNetUnfolderBase]: 8/159 cut-off events. [2025-04-29 11:12:07,443 INFO L117 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-04-29 11:12:07,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 159 events. 8/159 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 415 event pairs, 1 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-04-29 11:12:07,444 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 8 selfloop transitions, 3 changer transitions 2/88 dead transitions. [2025-04-29 11:12:07,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 88 transitions, 207 flow [2025-04-29 11:12:07,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-04-29 11:12:07,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9490196078431372 [2025-04-29 11:12:07,459 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 177 flow. Second operand 3 states and 242 transitions. [2025-04-29 11:12:07,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 88 transitions, 207 flow [2025-04-29 11:12:07,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 88 transitions, 207 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:07,470 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 195 flow [2025-04-29 11:12:07,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2025-04-29 11:12:07,476 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2025-04-29 11:12:07,478 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 195 flow [2025-04-29 11:12:07,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-04-29 11:12:07,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:07,479 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] [2025-04-29 11:12:07,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:12:07,479 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:12:07,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -55630499, now seen corresponding path program 1 times [2025-04-29 11:12:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:07,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875695072] [2025-04-29 11:12:07,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:07,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:07,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:07,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:07,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:07,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875695072] [2025-04-29 11:12:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875695072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:07,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53976079] [2025-04-29 11:12:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:07,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:07,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 85 [2025-04-29 11:12:07,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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-04-29 11:12:07,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 85 [2025-04-29 11:12:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:07,799 INFO L116 PetriNetUnfolderBase]: 17/232 cut-off events. [2025-04-29 11:12:07,799 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-29 11:12:07,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 232 events. 17/232 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 845 event pairs, 1 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 224. Up to 49 conditions per place. [2025-04-29 11:12:07,804 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 15 selfloop transitions, 2 changer transitions 5/92 dead transitions. [2025-04-29 11:12:07,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 253 flow [2025-04-29 11:12:07,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 437 transitions. [2025-04-29 11:12:07,809 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8568627450980392 [2025-04-29 11:12:07,809 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 195 flow. Second operand 6 states and 437 transitions. [2025-04-29 11:12:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 253 flow [2025-04-29 11:12:07,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:07,811 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 207 flow [2025-04-29 11:12:07,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2025-04-29 11:12:07,812 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 10 predicate places. [2025-04-29 11:12:07,812 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 207 flow [2025-04-29 11:12:07,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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-04-29 11:12:07,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:07,812 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] [2025-04-29 11:12:07,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:12:07,812 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:12:07,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 357732719, now seen corresponding path program 1 times [2025-04-29 11:12:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:07,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710920869] [2025-04-29 11:12:07,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:07,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:07,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:07,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:07,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:08,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710920869] [2025-04-29 11:12:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710920869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:08,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442015721] [2025-04-29 11:12:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:08,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:08,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:08,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:08,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 85 [2025-04-29 11:12:08,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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-04-29 11:12:08,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:08,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 85 [2025-04-29 11:12:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:08,308 INFO L116 PetriNetUnfolderBase]: 30/261 cut-off events. [2025-04-29 11:12:08,308 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-29 11:12:08,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 261 events. 30/261 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1148 event pairs, 5 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 323. Up to 61 conditions per place. [2025-04-29 11:12:08,312 INFO L140 encePairwiseOnDemand]: 79/85 looper letters, 24 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-04-29 11:12:08,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 279 flow [2025-04-29 11:12:08,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2025-04-29 11:12:08,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.788235294117647 [2025-04-29 11:12:08,316 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 207 flow. Second operand 6 states and 402 transitions. [2025-04-29 11:12:08,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 279 flow [2025-04-29 11:12:08,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 265 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:08,319 INFO L231 Difference]: Finished difference. Result has 92 places, 84 transitions, 201 flow [2025-04-29 11:12:08,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=92, PETRI_TRANSITIONS=84} [2025-04-29 11:12:08,320 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 6 predicate places. [2025-04-29 11:12:08,320 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 84 transitions, 201 flow [2025-04-29 11:12:08,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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-04-29 11:12:08,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,320 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] [2025-04-29 11:12:08,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:12:08,321 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:12:08,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash -665188413, now seen corresponding path program 1 times [2025-04-29 11:12:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53044066] [2025-04-29 11:12:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:12:08,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:12:08,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:08,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:08,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53044066] [2025-04-29 11:12:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53044066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:08,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:08,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:08,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563370253] [2025-04-29 11:12:08,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:08,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:08,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:08,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:08,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 85 [2025-04-29 11:12:08,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 84 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-04-29 11:12:08,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:08,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 85 [2025-04-29 11:12:08,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:08,403 INFO L116 PetriNetUnfolderBase]: 5/165 cut-off events. [2025-04-29 11:12:08,403 INFO L117 PetriNetUnfolderBase]: For 18/30 co-relation queries the response was YES. [2025-04-29 11:12:08,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 165 events. 5/165 cut-off events. For 18/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 477 event pairs, 3 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 175. Up to 25 conditions per place. [2025-04-29 11:12:08,404 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 8 selfloop transitions, 4 changer transitions 3/87 dead transitions. [2025-04-29 11:12:08,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 237 flow [2025-04-29 11:12:08,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2025-04-29 11:12:08,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9254901960784314 [2025-04-29 11:12:08,406 INFO L175 Difference]: Start difference. First operand has 92 places, 84 transitions, 201 flow. Second operand 3 states and 236 transitions. [2025-04-29 11:12:08,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 237 flow [2025-04-29 11:12:08,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 227 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:08,407 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 213 flow [2025-04-29 11:12:08,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2025-04-29 11:12:08,408 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 5 predicate places. [2025-04-29 11:12:08,408 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 213 flow [2025-04-29 11:12:08,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-04-29 11:12:08,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,408 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-04-29 11:12:08,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:12:08,409 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:12:08,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash -505349592, now seen corresponding path program 1 times [2025-04-29 11:12:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3391958] [2025-04-29 11:12:08,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:12:08,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:12:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:08,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3391958] [2025-04-29 11:12:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3391958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998754480] [2025-04-29 11:12:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:08,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:08,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:08,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:08,725 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2025-04-29 11:12:08,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 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-04-29 11:12:08,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:08,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2025-04-29 11:12:08,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:08,786 INFO L116 PetriNetUnfolderBase]: 25/278 cut-off events. [2025-04-29 11:12:08,786 INFO L117 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-04-29 11:12:08,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 278 events. 25/278 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1236 event pairs, 15 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2025-04-29 11:12:08,788 INFO L140 encePairwiseOnDemand]: 79/85 looper letters, 12 selfloop transitions, 0 changer transitions 20/91 dead transitions. [2025-04-29 11:12:08,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 281 flow [2025-04-29 11:12:08,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-04-29 11:12:08,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.807843137254902 [2025-04-29 11:12:08,789 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 213 flow. Second operand 6 states and 412 transitions. [2025-04-29 11:12:08,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 281 flow [2025-04-29 11:12:08,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:08,791 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 176 flow [2025-04-29 11:12:08,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2025-04-29 11:12:08,792 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 7 predicate places. [2025-04-29 11:12:08,792 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 176 flow [2025-04-29 11:12:08,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 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-04-29 11:12:08,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,792 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:08,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:12:08,793 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:12:08,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1443389939, now seen corresponding path program 1 times [2025-04-29 11:12:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027014266] [2025-04-29 11:12:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:12:08,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:12:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:08,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:12:08,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:12:08,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:08,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:08,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:08,846 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-29 11:12:08,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-29 11:12:08,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-29 11:12:08,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-29 11:12:08,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-29 11:12:08,848 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-29 11:12:08,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:12:08,848 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:12:08,850 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:12:08,850 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:12:08,867 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:12:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 222 flow [2025-04-29 11:12:08,886 INFO L116 PetriNetUnfolderBase]: 4/201 cut-off events. [2025-04-29 11:12:08,886 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:12:08,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 201 events. 4/201 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 441 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 119. Up to 6 conditions per place. [2025-04-29 11:12:08,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 103 transitions, 222 flow [2025-04-29 11:12:08,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 103 transitions, 222 flow [2025-04-29 11:12:08,888 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:08,890 INFO L340 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;@685644a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:08,890 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:12:08,892 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:08,892 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:12:08,893 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:08,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,893 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] [2025-04-29 11:12:08,893 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:08,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1733117097, now seen corresponding path program 1 times [2025-04-29 11:12:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160595176] [2025-04-29 11:12:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:08,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:08,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:08,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160595176] [2025-04-29 11:12:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160595176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:08,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110636160] [2025-04-29 11:12:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:08,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:08,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:08,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:08,917 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2025-04-29 11:12:08,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-04-29 11:12:08,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:08,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2025-04-29 11:12:08,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:08,984 INFO L116 PetriNetUnfolderBase]: 119/727 cut-off events. [2025-04-29 11:12:08,984 INFO L117 PetriNetUnfolderBase]: For 44/68 co-relation queries the response was YES. [2025-04-29 11:12:08,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 727 events. 119/727 cut-off events. For 44/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4251 event pairs, 50 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2025-04-29 11:12:08,988 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 16 selfloop transitions, 4 changer transitions 1/109 dead transitions. [2025-04-29 11:12:08,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 274 flow [2025-04-29 11:12:08,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-04-29 11:12:08,989 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9352750809061489 [2025-04-29 11:12:08,989 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 222 flow. Second operand 3 states and 289 transitions. [2025-04-29 11:12:08,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 109 transitions, 274 flow [2025-04-29 11:12:08,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 109 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:08,991 INFO L231 Difference]: Finished difference. Result has 109 places, 104 transitions, 248 flow [2025-04-29 11:12:08,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=109, PETRI_TRANSITIONS=104} [2025-04-29 11:12:08,992 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2025-04-29 11:12:08,992 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 248 flow [2025-04-29 11:12:08,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-04-29 11:12:08,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,992 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] [2025-04-29 11:12:08,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:12:08,993 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:08,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1609675613, now seen corresponding path program 1 times [2025-04-29 11:12:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914943826] [2025-04-29 11:12:08,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:09,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:09,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:09,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:09,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914943826] [2025-04-29 11:12:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914943826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693028139] [2025-04-29 11:12:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:09,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:09,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:09,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:09,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 103 [2025-04-29 11:12:09,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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-04-29 11:12:09,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:09,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 103 [2025-04-29 11:12:09,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:09,224 INFO L116 PetriNetUnfolderBase]: 189/1191 cut-off events. [2025-04-29 11:12:09,225 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-29 11:12:09,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1191 events. 189/1191 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8541 event pairs, 131 based on Foata normal form. 1/1092 useless extension candidates. Maximal degree in co-relation 1090. Up to 314 conditions per place. [2025-04-29 11:12:09,231 INFO L140 encePairwiseOnDemand]: 95/103 looper letters, 20 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2025-04-29 11:12:09,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 318 flow [2025-04-29 11:12:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2025-04-29 11:12:09,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8511326860841424 [2025-04-29 11:12:09,233 INFO L175 Difference]: Start difference. First operand has 109 places, 104 transitions, 248 flow. Second operand 6 states and 526 transitions. [2025-04-29 11:12:09,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 318 flow [2025-04-29 11:12:09,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:09,236 INFO L231 Difference]: Finished difference. Result has 115 places, 105 transitions, 262 flow [2025-04-29 11:12:09,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=115, PETRI_TRANSITIONS=105} [2025-04-29 11:12:09,237 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2025-04-29 11:12:09,237 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 105 transitions, 262 flow [2025-04-29 11:12:09,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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-04-29 11:12:09,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:09,237 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] [2025-04-29 11:12:09,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:12:09,237 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:09,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2023038831, now seen corresponding path program 1 times [2025-04-29 11:12:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:09,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424281634] [2025-04-29 11:12:09,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:09,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:09,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:09,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:09,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:09,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424281634] [2025-04-29 11:12:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424281634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924460063] [2025-04-29 11:12:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:09,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:09,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:09,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:09,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:09,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 103 [2025-04-29 11:12:09,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 105 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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-04-29 11:12:09,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:09,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 103 [2025-04-29 11:12:09,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:09,668 INFO L116 PetriNetUnfolderBase]: 298/1278 cut-off events. [2025-04-29 11:12:09,668 INFO L117 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-04-29 11:12:09,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 1278 events. 298/1278 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9679 event pairs, 130 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 955. Up to 371 conditions per place. [2025-04-29 11:12:09,673 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 37 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2025-04-29 11:12:09,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 120 transitions, 376 flow [2025-04-29 11:12:09,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 498 transitions. [2025-04-29 11:12:09,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8058252427184466 [2025-04-29 11:12:09,675 INFO L175 Difference]: Start difference. First operand has 115 places, 105 transitions, 262 flow. Second operand 6 states and 498 transitions. [2025-04-29 11:12:09,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 120 transitions, 376 flow [2025-04-29 11:12:09,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 364 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:12:09,677 INFO L231 Difference]: Finished difference. Result has 112 places, 104 transitions, 258 flow [2025-04-29 11:12:09,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=112, PETRI_TRANSITIONS=104} [2025-04-29 11:12:09,678 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2025-04-29 11:12:09,678 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 258 flow [2025-04-29 11:12:09,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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-04-29 11:12:09,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:09,678 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] [2025-04-29 11:12:09,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:12:09,678 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:09,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1808349203, now seen corresponding path program 1 times [2025-04-29 11:12:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:09,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073900372] [2025-04-29 11:12:09,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:09,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:12:09,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:12:09,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:09,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:09,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073900372] [2025-04-29 11:12:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073900372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:09,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931474435] [2025-04-29 11:12:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:09,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:09,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:09,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:09,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:09,711 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103 [2025-04-29 11:12:09,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-04-29 11:12:09,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:09,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103 [2025-04-29 11:12:09,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:09,781 INFO L116 PetriNetUnfolderBase]: 165/993 cut-off events. [2025-04-29 11:12:09,781 INFO L117 PetriNetUnfolderBase]: For 190/315 co-relation queries the response was YES. [2025-04-29 11:12:09,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 993 events. 165/993 cut-off events. For 190/315 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7217 event pairs, 88 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 1281. Up to 269 conditions per place. [2025-04-29 11:12:09,786 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 19 selfloop transitions, 7 changer transitions 0/113 dead transitions. [2025-04-29 11:12:09,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 113 transitions, 342 flow [2025-04-29 11:12:09,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2025-04-29 11:12:09,787 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9223300970873787 [2025-04-29 11:12:09,787 INFO L175 Difference]: Start difference. First operand has 112 places, 104 transitions, 258 flow. Second operand 3 states and 285 transitions. [2025-04-29 11:12:09,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 113 transitions, 342 flow [2025-04-29 11:12:09,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 332 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:09,789 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 304 flow [2025-04-29 11:12:09,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-04-29 11:12:09,790 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2025-04-29 11:12:09,790 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 304 flow [2025-04-29 11:12:09,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-04-29 11:12:09,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:09,790 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-04-29 11:12:09,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:12:09,791 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:09,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash 278570399, now seen corresponding path program 1 times [2025-04-29 11:12:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:09,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928289732] [2025-04-29 11:12:09,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:09,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:12:09,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:12:09,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:09,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:10,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928289732] [2025-04-29 11:12:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928289732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790153704] [2025-04-29 11:12:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:10,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:10,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:10,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 103 [2025-04-29 11:12:10,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-04-29 11:12:10,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:10,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 103 [2025-04-29 11:12:10,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:10,236 INFO L116 PetriNetUnfolderBase]: 358/1833 cut-off events. [2025-04-29 11:12:10,236 INFO L117 PetriNetUnfolderBase]: For 306/354 co-relation queries the response was YES. [2025-04-29 11:12:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 1833 events. 358/1833 cut-off events. For 306/354 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15486 event pairs, 179 based on Foata normal form. 4/1677 useless extension candidates. Maximal degree in co-relation 2430. Up to 362 conditions per place. [2025-04-29 11:12:10,244 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 34 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-04-29 11:12:10,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 124 transitions, 412 flow [2025-04-29 11:12:10,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2025-04-29 11:12:10,245 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8220064724919094 [2025-04-29 11:12:10,245 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 304 flow. Second operand 6 states and 508 transitions. [2025-04-29 11:12:10,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 124 transitions, 412 flow [2025-04-29 11:12:10,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 124 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:10,248 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 298 flow [2025-04-29 11:12:10,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-04-29 11:12:10,249 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2025-04-29 11:12:10,249 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 298 flow [2025-04-29 11:12:10,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-04-29 11:12:10,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:10,249 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] [2025-04-29 11:12:10,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:12:10,249 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:10,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -687895748, now seen corresponding path program 1 times [2025-04-29 11:12:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:10,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244561294] [2025-04-29 11:12:10,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:10,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:12:10,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:12:10,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:10,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:10,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244561294] [2025-04-29 11:12:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244561294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:10,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:10,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200221468] [2025-04-29 11:12:10,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:10,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:10,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:10,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:10,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 103 [2025-04-29 11:12:10,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-04-29 11:12:10,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:10,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 103 [2025-04-29 11:12:10,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:10,492 INFO L116 PetriNetUnfolderBase]: 140/1009 cut-off events. [2025-04-29 11:12:10,492 INFO L117 PetriNetUnfolderBase]: For 139/166 co-relation queries the response was YES. [2025-04-29 11:12:10,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1009 events. 140/1009 cut-off events. For 139/166 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6984 event pairs, 69 based on Foata normal form. 15/962 useless extension candidates. Maximal degree in co-relation 974. Up to 191 conditions per place. [2025-04-29 11:12:10,495 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 23 selfloop transitions, 6 changer transitions 6/121 dead transitions. [2025-04-29 11:12:10,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 121 transitions, 398 flow [2025-04-29 11:12:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-04-29 11:12:10,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8543689320388349 [2025-04-29 11:12:10,497 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 298 flow. Second operand 6 states and 528 transitions. [2025-04-29 11:12:10,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 121 transitions, 398 flow [2025-04-29 11:12:10,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 121 transitions, 386 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:10,499 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 304 flow [2025-04-29 11:12:10,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2025-04-29 11:12:10,499 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2025-04-29 11:12:10,499 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 304 flow [2025-04-29 11:12:10,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-04-29 11:12:10,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:10,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:10,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:12:10,500 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:10,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 530524420, now seen corresponding path program 1 times [2025-04-29 11:12:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:10,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935642288] [2025-04-29 11:12:10,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:12:10,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:12:10,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:10,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:10,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935642288] [2025-04-29 11:12:10,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935642288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:10,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949763504] [2025-04-29 11:12:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:10,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:10,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:10,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:10,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103 [2025-04-29 11:12:10,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-04-29 11:12:10,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:10,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103 [2025-04-29 11:12:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:10,622 INFO L116 PetriNetUnfolderBase]: 56/624 cut-off events. [2025-04-29 11:12:10,622 INFO L117 PetriNetUnfolderBase]: For 215/280 co-relation queries the response was YES. [2025-04-29 11:12:10,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 624 events. 56/624 cut-off events. For 215/280 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3795 event pairs, 30 based on Foata normal form. 3/604 useless extension candidates. Maximal degree in co-relation 892. Up to 119 conditions per place. [2025-04-29 11:12:10,625 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 19 selfloop transitions, 7 changer transitions 1/115 dead transitions. [2025-04-29 11:12:10,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 381 flow [2025-04-29 11:12:10,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-04-29 11:12:10,626 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2025-04-29 11:12:10,626 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 304 flow. Second operand 3 states and 284 transitions. [2025-04-29 11:12:10,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 381 flow [2025-04-29 11:12:10,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 373 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:10,628 INFO L231 Difference]: Finished difference. Result has 116 places, 111 transitions, 346 flow [2025-04-29 11:12:10,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=116, PETRI_TRANSITIONS=111} [2025-04-29 11:12:10,629 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2025-04-29 11:12:10,629 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 111 transitions, 346 flow [2025-04-29 11:12:10,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-04-29 11:12:10,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:10,629 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 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-04-29 11:12:10,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:12:10,629 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:12:10,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1340887628, now seen corresponding path program 1 times [2025-04-29 11:12:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:10,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13233208] [2025-04-29 11:12:10,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:10,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:10,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:12:10,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:12:10,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:10,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:10,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:12:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:12:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:10,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:10,664 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:12:10,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:12:10,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:12:10,665 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:10,666 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:12:10,666 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:12:10,680 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:12:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 121 transitions, 269 flow [2025-04-29 11:12:10,705 INFO L116 PetriNetUnfolderBase]: 9/334 cut-off events. [2025-04-29 11:12:10,705 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:12:10,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 334 events. 9/334 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 950 event pairs, 1 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 209. Up to 12 conditions per place. [2025-04-29 11:12:10,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 121 transitions, 269 flow [2025-04-29 11:12:10,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 121 transitions, 269 flow [2025-04-29 11:12:10,709 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:10,709 INFO L340 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;@685644a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:10,709 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-29 11:12:10,711 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:10,711 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:12:10,712 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:10,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:10,712 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] [2025-04-29 11:12:10,712 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:10,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:10,712 INFO L85 PathProgramCache]: Analyzing trace with hash 141533065, now seen corresponding path program 1 times [2025-04-29 11:12:10,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:10,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646214271] [2025-04-29 11:12:10,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:10,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:10,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:10,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:10,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:10,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646214271] [2025-04-29 11:12:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646214271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599160358] [2025-04-29 11:12:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:10,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:10,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:10,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:10,736 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 121 [2025-04-29 11:12:10,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-04-29 11:12:10,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:10,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 121 [2025-04-29 11:12:10,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:10,977 INFO L116 PetriNetUnfolderBase]: 1071/4018 cut-off events. [2025-04-29 11:12:10,977 INFO L117 PetriNetUnfolderBase]: For 416/521 co-relation queries the response was YES. [2025-04-29 11:12:10,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5933 conditions, 4018 events. 1071/4018 cut-off events. For 416/521 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 36417 event pairs, 542 based on Foata normal form. 1/3578 useless extension candidates. Maximal degree in co-relation 4652. Up to 1110 conditions per place. [2025-04-29 11:12:11,025 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 23 selfloop transitions, 5 changer transitions 1/130 dead transitions. [2025-04-29 11:12:11,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 130 transitions, 343 flow [2025-04-29 11:12:11,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-04-29 11:12:11,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9256198347107438 [2025-04-29 11:12:11,028 INFO L175 Difference]: Start difference. First operand has 124 places, 121 transitions, 269 flow. Second operand 3 states and 336 transitions. [2025-04-29 11:12:11,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 130 transitions, 343 flow [2025-04-29 11:12:11,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 130 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:11,030 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 303 flow [2025-04-29 11:12:11,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2025-04-29 11:12:11,031 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2025-04-29 11:12:11,031 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 303 flow [2025-04-29 11:12:11,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-04-29 11:12:11,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:11,032 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] [2025-04-29 11:12:11,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:12:11,032 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:11,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1105782109, now seen corresponding path program 1 times [2025-04-29 11:12:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:11,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251871290] [2025-04-29 11:12:11,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:11,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:11,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:11,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:11,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:11,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251871290] [2025-04-29 11:12:11,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251871290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:11,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:11,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297369364] [2025-04-29 11:12:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:11,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:11,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:11,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:11,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2025-04-29 11:12:11,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-04-29 11:12:11,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:11,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2025-04-29 11:12:11,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:11,624 INFO L116 PetriNetUnfolderBase]: 1404/6334 cut-off events. [2025-04-29 11:12:11,624 INFO L117 PetriNetUnfolderBase]: For 436/444 co-relation queries the response was YES. [2025-04-29 11:12:11,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9232 conditions, 6334 events. 1404/6334 cut-off events. For 436/444 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 64074 event pairs, 1086 based on Foata normal form. 1/5695 useless extension candidates. Maximal degree in co-relation 5660. Up to 1847 conditions per place. [2025-04-29 11:12:11,659 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 24 selfloop transitions, 2 changer transitions 5/131 dead transitions. [2025-04-29 11:12:11,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 131 transitions, 381 flow [2025-04-29 11:12:11,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2025-04-29 11:12:11,661 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8457300275482094 [2025-04-29 11:12:11,661 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 303 flow. Second operand 6 states and 614 transitions. [2025-04-29 11:12:11,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 131 transitions, 381 flow [2025-04-29 11:12:11,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 131 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:11,666 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 315 flow [2025-04-29 11:12:11,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2025-04-29 11:12:11,666 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2025-04-29 11:12:11,667 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 315 flow [2025-04-29 11:12:11,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-04-29 11:12:11,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:11,667 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] [2025-04-29 11:12:11,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:12:11,667 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:11,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1519145327, now seen corresponding path program 1 times [2025-04-29 11:12:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:11,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973763055] [2025-04-29 11:12:11,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:11,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:11,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:11,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973763055] [2025-04-29 11:12:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973763055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:11,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:11,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415668971] [2025-04-29 11:12:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:11,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:11,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:11,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:11,889 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 121 [2025-04-29 11:12:11,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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-04-29 11:12:11,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:11,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 121 [2025-04-29 11:12:11,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:12,500 INFO L116 PetriNetUnfolderBase]: 2000/6718 cut-off events. [2025-04-29 11:12:12,500 INFO L117 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2025-04-29 11:12:12,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10947 conditions, 6718 events. 2000/6718 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 67119 event pairs, 899 based on Foata normal form. 0/6076 useless extension candidates. Maximal degree in co-relation 10613. Up to 2164 conditions per place. [2025-04-29 11:12:12,542 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 49 selfloop transitions, 5 changer transitions 0/147 dead transitions. [2025-04-29 11:12:12,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 469 flow [2025-04-29 11:12:12,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2025-04-29 11:12:12,544 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2025-04-29 11:12:12,544 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 315 flow. Second operand 6 states and 594 transitions. [2025-04-29 11:12:12,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 469 flow [2025-04-29 11:12:12,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 147 transitions, 457 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:12:12,553 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 311 flow [2025-04-29 11:12:12,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2025-04-29 11:12:12,554 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2025-04-29 11:12:12,554 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 311 flow [2025-04-29 11:12:12,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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-04-29 11:12:12,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:12,555 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] [2025-04-29 11:12:12,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:12:12,555 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:12,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1226074051, now seen corresponding path program 1 times [2025-04-29 11:12:12,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:12,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345770846] [2025-04-29 11:12:12,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:12,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:12:12,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:12:12,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:12,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:12,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:12,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345770846] [2025-04-29 11:12:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345770846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099702355] [2025-04-29 11:12:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:12,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:12,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:12,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:12,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 121 [2025-04-29 11:12:12,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-04-29 11:12:12,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:12,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 121 [2025-04-29 11:12:12,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:13,154 INFO L116 PetriNetUnfolderBase]: 1734/6920 cut-off events. [2025-04-29 11:12:13,155 INFO L117 PetriNetUnfolderBase]: For 1757/2580 co-relation queries the response was YES. [2025-04-29 11:12:13,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11256 conditions, 6920 events. 1734/6920 cut-off events. For 1757/2580 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 73257 event pairs, 877 based on Foata normal form. 17/6041 useless extension candidates. Maximal degree in co-relation 4117. Up to 2211 conditions per place. [2025-04-29 11:12:13,189 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 29 selfloop transitions, 9 changer transitions 0/138 dead transitions. [2025-04-29 11:12:13,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 138 transitions, 445 flow [2025-04-29 11:12:13,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-04-29 11:12:13,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9201101928374655 [2025-04-29 11:12:13,190 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 311 flow. Second operand 3 states and 334 transitions. [2025-04-29 11:12:13,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 138 transitions, 445 flow [2025-04-29 11:12:13,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 138 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:13,193 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 377 flow [2025-04-29 11:12:13,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2025-04-29 11:12:13,194 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 6 predicate places. [2025-04-29 11:12:13,194 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 377 flow [2025-04-29 11:12:13,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-04-29 11:12:13,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:13,194 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-04-29 11:12:13,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:12:13,194 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:13,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash 918166312, now seen corresponding path program 1 times [2025-04-29 11:12:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:13,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74282797] [2025-04-29 11:12:13,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:13,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:12:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:12:13,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:13,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:13,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74282797] [2025-04-29 11:12:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74282797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994542965] [2025-04-29 11:12:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:13,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:13,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:13,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:13,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 121 [2025-04-29 11:12:13,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-04-29 11:12:13,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:13,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 121 [2025-04-29 11:12:13,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:14,330 INFO L116 PetriNetUnfolderBase]: 2874/10359 cut-off events. [2025-04-29 11:12:14,330 INFO L117 PetriNetUnfolderBase]: For 1701/2255 co-relation queries the response was YES. [2025-04-29 11:12:14,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17509 conditions, 10359 events. 2874/10359 cut-off events. For 1701/2255 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114367 event pairs, 1408 based on Foata normal form. 17/9206 useless extension candidates. Maximal degree in co-relation 13929. Up to 2157 conditions per place. [2025-04-29 11:12:14,476 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 46 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-04-29 11:12:14,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 153 transitions, 525 flow [2025-04-29 11:12:14,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2025-04-29 11:12:14,478 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8319559228650137 [2025-04-29 11:12:14,478 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 377 flow. Second operand 6 states and 604 transitions. [2025-04-29 11:12:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 153 transitions, 525 flow [2025-04-29 11:12:14,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 153 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:14,485 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 367 flow [2025-04-29 11:12:14,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-04-29 11:12:14,486 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 8 predicate places. [2025-04-29 11:12:14,486 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 367 flow [2025-04-29 11:12:14,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-04-29 11:12:14,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:14,486 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] [2025-04-29 11:12:14,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:12:14,486 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:14,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1152239803, now seen corresponding path program 1 times [2025-04-29 11:12:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:14,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516690658] [2025-04-29 11:12:14,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:14,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:12:14,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:12:14,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:14,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516690658] [2025-04-29 11:12:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516690658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742768533] [2025-04-29 11:12:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:14,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:14,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:14,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2025-04-29 11:12:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-04-29 11:12:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2025-04-29 11:12:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:14,969 INFO L116 PetriNetUnfolderBase]: 1305/6246 cut-off events. [2025-04-29 11:12:14,969 INFO L117 PetriNetUnfolderBase]: For 973/1232 co-relation queries the response was YES. [2025-04-29 11:12:14,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10208 conditions, 6246 events. 1305/6246 cut-off events. For 973/1232 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 64729 event pairs, 673 based on Foata normal form. 65/5737 useless extension candidates. Maximal degree in co-relation 5035. Up to 1228 conditions per place. [2025-04-29 11:12:14,997 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 38 selfloop transitions, 6 changer transitions 0/148 dead transitions. [2025-04-29 11:12:14,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 148 transitions, 504 flow [2025-04-29 11:12:14,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2025-04-29 11:12:14,999 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8553719008264463 [2025-04-29 11:12:14,999 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 367 flow. Second operand 6 states and 621 transitions. [2025-04-29 11:12:14,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 148 transitions, 504 flow [2025-04-29 11:12:15,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 148 transitions, 492 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:15,004 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 383 flow [2025-04-29 11:12:15,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-04-29 11:12:15,005 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2025-04-29 11:12:15,005 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 383 flow [2025-04-29 11:12:15,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-04-29 11:12:15,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:15,005 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:15,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:12:15,005 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:15,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1582732509, now seen corresponding path program 1 times [2025-04-29 11:12:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:15,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063788894] [2025-04-29 11:12:15,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:15,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:12:15,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:12:15,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:15,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:15,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:15,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063788894] [2025-04-29 11:12:15,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063788894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:15,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915124923] [2025-04-29 11:12:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:15,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:15,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:15,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:15,043 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 121 [2025-04-29 11:12:15,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-04-29 11:12:15,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:15,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 121 [2025-04-29 11:12:15,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:15,418 INFO L116 PetriNetUnfolderBase]: 1081/5167 cut-off events. [2025-04-29 11:12:15,418 INFO L117 PetriNetUnfolderBase]: For 2634/3105 co-relation queries the response was YES. [2025-04-29 11:12:15,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9198 conditions, 5167 events. 1081/5167 cut-off events. For 2634/3105 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 54293 event pairs, 542 based on Foata normal form. 20/4731 useless extension candidates. Maximal degree in co-relation 8337. Up to 1420 conditions per place. [2025-04-29 11:12:15,442 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 31 selfloop transitions, 13 changer transitions 0/147 dead transitions. [2025-04-29 11:12:15,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 147 transitions, 544 flow [2025-04-29 11:12:15,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2025-04-29 11:12:15,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9173553719008265 [2025-04-29 11:12:15,444 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 383 flow. Second operand 3 states and 333 transitions. [2025-04-29 11:12:15,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 147 transitions, 544 flow [2025-04-29 11:12:15,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 147 transitions, 536 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:15,447 INFO L231 Difference]: Finished difference. Result has 135 places, 140 transitions, 493 flow [2025-04-29 11:12:15,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=135, PETRI_TRANSITIONS=140} [2025-04-29 11:12:15,447 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2025-04-29 11:12:15,447 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 140 transitions, 493 flow [2025-04-29 11:12:15,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-04-29 11:12:15,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:15,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:15,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:12:15,448 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:15,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1342423311, now seen corresponding path program 1 times [2025-04-29 11:12:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:15,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737399275] [2025-04-29 11:12:15,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:15,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:12:15,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:12:15,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:15,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:15,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:15,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737399275] [2025-04-29 11:12:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737399275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:12:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321646646] [2025-04-29 11:12:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:15,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:15,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:15,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:15,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2025-04-29 11:12:15,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 140 transitions, 493 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-04-29 11:12:15,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:15,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2025-04-29 11:12:15,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:15,608 INFO L116 PetriNetUnfolderBase]: 124/1672 cut-off events. [2025-04-29 11:12:15,608 INFO L117 PetriNetUnfolderBase]: For 690/781 co-relation queries the response was YES. [2025-04-29 11:12:15,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 1672 events. 124/1672 cut-off events. For 690/781 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 13862 event pairs, 20 based on Foata normal form. 21/1625 useless extension candidates. Maximal degree in co-relation 1087. Up to 142 conditions per place. [2025-04-29 11:12:15,613 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 12 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-04-29 11:12:15,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 466 flow [2025-04-29 11:12:15,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-04-29 11:12:15,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2025-04-29 11:12:15,614 INFO L175 Difference]: Start difference. First operand has 135 places, 140 transitions, 493 flow. Second operand 3 states and 342 transitions. [2025-04-29 11:12:15,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 466 flow [2025-04-29 11:12:15,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 452 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:15,617 INFO L231 Difference]: Finished difference. Result has 135 places, 130 transitions, 397 flow [2025-04-29 11:12:15,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=135, PETRI_TRANSITIONS=130} [2025-04-29 11:12:15,618 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2025-04-29 11:12:15,618 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 130 transitions, 397 flow [2025-04-29 11:12:15,618 INFO L486 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-04-29 11:12:15,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:15,618 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:15,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:12:15,618 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:15,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 735289858, now seen corresponding path program 1 times [2025-04-29 11:12:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:15,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123657471] [2025-04-29 11:12:15,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:15,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:15,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-29 11:12:15,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 11:12:15,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:15,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123657471] [2025-04-29 11:12:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123657471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:15,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:15,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029589411] [2025-04-29 11:12:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:15,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:15,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:15,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:15,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 121 [2025-04-29 11:12:15,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 130 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-04-29 11:12:15,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:15,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 121 [2025-04-29 11:12:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:15,777 INFO L116 PetriNetUnfolderBase]: 203/1854 cut-off events. [2025-04-29 11:12:15,777 INFO L117 PetriNetUnfolderBase]: For 1325/1390 co-relation queries the response was YES. [2025-04-29 11:12:15,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 1854 events. 203/1854 cut-off events. For 1325/1390 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16393 event pairs, 134 based on Foata normal form. 3/1765 useless extension candidates. Maximal degree in co-relation 2878. Up to 435 conditions per place. [2025-04-29 11:12:15,781 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 25 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-04-29 11:12:15,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 479 flow [2025-04-29 11:12:15,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2025-04-29 11:12:15,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8980716253443526 [2025-04-29 11:12:15,782 INFO L175 Difference]: Start difference. First operand has 135 places, 130 transitions, 397 flow. Second operand 3 states and 326 transitions. [2025-04-29 11:12:15,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 479 flow [2025-04-29 11:12:15,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:12:15,785 INFO L231 Difference]: Finished difference. Result has 138 places, 133 transitions, 431 flow [2025-04-29 11:12:15,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2025-04-29 11:12:15,785 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places. [2025-04-29 11:12:15,785 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 431 flow [2025-04-29 11:12:15,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-04-29 11:12:15,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:15,785 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 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-04-29 11:12:15,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:12:15,786 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:12:15,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2120893102, now seen corresponding path program 1 times [2025-04-29 11:12:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:15,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496886417] [2025-04-29 11:12:15,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:15,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:12:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:12:15,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:15,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:15,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:12:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:12:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:15,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:15,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-29 11:12:15,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-29 11:12:15,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:12:15,822 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:15,823 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:12:15,823 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-29 11:12:15,840 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-29 11:12:15,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 139 transitions, 318 flow [2025-04-29 11:12:15,866 INFO L116 PetriNetUnfolderBase]: 22/567 cut-off events. [2025-04-29 11:12:15,866 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-29 11:12:15,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 567 events. 22/567 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2085 event pairs, 6 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 354. Up to 32 conditions per place. [2025-04-29 11:12:15,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 139 transitions, 318 flow [2025-04-29 11:12:15,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 139 transitions, 318 flow [2025-04-29 11:12:15,869 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:15,869 INFO L340 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;@685644a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:15,869 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:12:15,871 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:15,871 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:12:15,871 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:15,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:15,871 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] [2025-04-29 11:12:15,871 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:15,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 478415913, now seen corresponding path program 1 times [2025-04-29 11:12:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:15,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822251026] [2025-04-29 11:12:15,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:15,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:15,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:15,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:15,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:15,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822251026] [2025-04-29 11:12:15,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822251026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:15,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:15,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501923581] [2025-04-29 11:12:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:15,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:15,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:15,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:15,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 139 [2025-04-29 11:12:15,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 139 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-04-29 11:12:15,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:15,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 139 [2025-04-29 11:12:15,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:17,504 INFO L116 PetriNetUnfolderBase]: 7859/23531 cut-off events. [2025-04-29 11:12:17,504 INFO L117 PetriNetUnfolderBase]: For 2506/2857 co-relation queries the response was YES. [2025-04-29 11:12:17,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35881 conditions, 23531 events. 7859/23531 cut-off events. For 2506/2857 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 270965 event pairs, 4292 based on Foata normal form. 1/21312 useless extension candidates. Maximal degree in co-relation 28583. Up to 7653 conditions per place. [2025-04-29 11:12:17,635 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 30 selfloop transitions, 6 changer transitions 1/151 dead transitions. [2025-04-29 11:12:17,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 151 transitions, 414 flow [2025-04-29 11:12:17,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-04-29 11:12:17,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9184652278177458 [2025-04-29 11:12:17,637 INFO L175 Difference]: Start difference. First operand has 143 places, 139 transitions, 318 flow. Second operand 3 states and 383 transitions. [2025-04-29 11:12:17,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 151 transitions, 414 flow [2025-04-29 11:12:17,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 151 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:17,640 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 360 flow [2025-04-29 11:12:17,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-04-29 11:12:17,641 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 4 predicate places. [2025-04-29 11:12:17,641 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 360 flow [2025-04-29 11:12:17,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-04-29 11:12:17,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:17,642 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] [2025-04-29 11:12:17,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:12:17,642 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:17,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1567311011, now seen corresponding path program 1 times [2025-04-29 11:12:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:17,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835881704] [2025-04-29 11:12:17,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:17,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:17,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:17,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:17,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835881704] [2025-04-29 11:12:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835881704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:17,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:17,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:17,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255938970] [2025-04-29 11:12:17,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:17,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:17,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:17,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:17,734 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 139 [2025-04-29 11:12:17,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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-04-29 11:12:17,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:17,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 139 [2025-04-29 11:12:17,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:20,258 INFO L116 PetriNetUnfolderBase]: 9343/33727 cut-off events. [2025-04-29 11:12:20,258 INFO L117 PetriNetUnfolderBase]: For 2596/2684 co-relation queries the response was YES. [2025-04-29 11:12:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50644 conditions, 33727 events. 9343/33727 cut-off events. For 2596/2684 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 430120 event pairs, 7523 based on Foata normal form. 1/29826 useless extension candidates. Maximal degree in co-relation 31515. Up to 10778 conditions per place. [2025-04-29 11:12:20,426 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 28 selfloop transitions, 2 changer transitions 5/150 dead transitions. [2025-04-29 11:12:20,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 150 transitions, 446 flow [2025-04-29 11:12:20,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-04-29 11:12:20,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.841726618705036 [2025-04-29 11:12:20,428 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 360 flow. Second operand 6 states and 702 transitions. [2025-04-29 11:12:20,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 150 transitions, 446 flow [2025-04-29 11:12:20,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 150 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:20,467 INFO L231 Difference]: Finished difference. Result has 153 places, 143 transitions, 370 flow [2025-04-29 11:12:20,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=153, PETRI_TRANSITIONS=143} [2025-04-29 11:12:20,467 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 10 predicate places. [2025-04-29 11:12:20,467 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 143 transitions, 370 flow [2025-04-29 11:12:20,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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-04-29 11:12:20,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:20,468 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] [2025-04-29 11:12:20,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:12:20,468 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:20,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1153947793, now seen corresponding path program 1 times [2025-04-29 11:12:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:20,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384555542] [2025-04-29 11:12:20,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:20,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:20,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:20,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:20,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:20,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384555542] [2025-04-29 11:12:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384555542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:20,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:20,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:20,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531963652] [2025-04-29 11:12:20,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:20,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:20,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:20,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:20,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:20,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-04-29 11:12:20,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 143 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-04-29 11:12:20,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:20,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-04-29 11:12:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:24,180 INFO L116 PetriNetUnfolderBase]: 12654/35359 cut-off events. [2025-04-29 11:12:24,180 INFO L117 PetriNetUnfolderBase]: For 3229/3233 co-relation queries the response was YES. [2025-04-29 11:12:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58249 conditions, 35359 events. 12654/35359 cut-off events. For 3229/3233 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 427949 event pairs, 6023 based on Foata normal form. 0/31665 useless extension candidates. Maximal degree in co-relation 26579. Up to 12817 conditions per place. [2025-04-29 11:12:24,407 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 61 selfloop transitions, 5 changer transitions 0/174 dead transitions. [2025-04-29 11:12:24,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 174 transitions, 564 flow [2025-04-29 11:12:24,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2025-04-29 11:12:24,408 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8273381294964028 [2025-04-29 11:12:24,408 INFO L175 Difference]: Start difference. First operand has 153 places, 143 transitions, 370 flow. Second operand 6 states and 690 transitions. [2025-04-29 11:12:24,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 174 transitions, 564 flow [2025-04-29 11:12:24,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 174 transitions, 552 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:12:24,431 INFO L231 Difference]: Finished difference. Result has 150 places, 142 transitions, 366 flow [2025-04-29 11:12:24,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=150, PETRI_TRANSITIONS=142} [2025-04-29 11:12:24,432 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 7 predicate places. [2025-04-29 11:12:24,432 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 142 transitions, 366 flow [2025-04-29 11:12:24,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-04-29 11:12:24,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:24,432 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] [2025-04-29 11:12:24,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:12:24,432 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:24,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1887977853, now seen corresponding path program 1 times [2025-04-29 11:12:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:24,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62508181] [2025-04-29 11:12:24,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:24,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:24,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:12:24,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:12:24,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:24,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:24,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62508181] [2025-04-29 11:12:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62508181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774640631] [2025-04-29 11:12:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:24,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:24,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:24,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:24,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 139 [2025-04-29 11:12:24,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 142 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-04-29 11:12:24,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:24,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 139 [2025-04-29 11:12:24,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:27,614 INFO L116 PetriNetUnfolderBase]: 13656/42607 cut-off events. [2025-04-29 11:12:27,614 INFO L117 PetriNetUnfolderBase]: For 10713/14289 co-relation queries the response was YES. [2025-04-29 11:12:27,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72081 conditions, 42607 events. 13656/42607 cut-off events. For 10713/14289 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 550644 event pairs, 7252 based on Foata normal form. 37/37411 useless extension candidates. Maximal degree in co-relation 32428. Up to 15881 conditions per place. [2025-04-29 11:12:27,887 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 39 selfloop transitions, 11 changer transitions 0/163 dead transitions. [2025-04-29 11:12:27,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 552 flow [2025-04-29 11:12:27,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-04-29 11:12:27,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9184652278177458 [2025-04-29 11:12:27,888 INFO L175 Difference]: Start difference. First operand has 150 places, 142 transitions, 366 flow. Second operand 3 states and 383 transitions. [2025-04-29 11:12:27,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 552 flow [2025-04-29 11:12:27,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 163 transitions, 542 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:27,892 INFO L231 Difference]: Finished difference. Result has 149 places, 151 transitions, 452 flow [2025-04-29 11:12:27,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=149, PETRI_TRANSITIONS=151} [2025-04-29 11:12:27,893 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 6 predicate places. [2025-04-29 11:12:27,893 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 151 transitions, 452 flow [2025-04-29 11:12:27,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-04-29 11:12:27,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:27,894 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-04-29 11:12:27,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:12:27,895 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:27,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1413438147, now seen corresponding path program 1 times [2025-04-29 11:12:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:27,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815492400] [2025-04-29 11:12:27,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:27,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:27,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:12:27,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:12:27,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:28,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:28,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815492400] [2025-04-29 11:12:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815492400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:28,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508117942] [2025-04-29 11:12:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:28,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:28,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:28,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:28,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2025-04-29 11:12:28,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 151 transitions, 452 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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-04-29 11:12:28,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:28,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2025-04-29 11:12:28,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:31,508 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L24-4-->L24-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet2_3|) InVars {threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|} OutVars{threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][148], [77#L24-5true, 41#L23-3true, 109#L25true, 173#true, Black: 148#(= |#race~data~0| 0), Black: 170#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 140#true, 143#true, Black: 153#(= |ULTIMATE.start_main_~i~0#1| 0), 138#true, 168#true, 127#L47-1true, 142#true]) [2025-04-29 11:12:31,509 INFO L286 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-04-29 11:12:31,509 INFO L289 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-04-29 11:12:31,509 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-29 11:12:31,509 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-29 11:12:31,595 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][180], [72#L24-6true, 139#true, 77#L24-5true, 173#true, Black: 148#(= |#race~data~0| 0), Black: 170#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), Black: 153#(= |ULTIMATE.start_main_~i~0#1| 0), 138#true, 7#L24-5true, 168#true, 127#L47-1true, 144#true, 142#true]) [2025-04-29 11:12:31,595 INFO L286 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-04-29 11:12:31,596 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:31,596 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:31,596 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:31,644 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L24-4-->L24-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet2_3|) InVars {threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|} OutVars{threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][148], [18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 77#L24-5true, 173#true, Black: 148#(= |#race~data~0| 0), Black: 170#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 140#true, 143#true, Black: 153#(= |ULTIMATE.start_main_~i~0#1| 0), 138#true, 168#true, 48#L24-5true, 127#L47-1true, 142#true]) [2025-04-29 11:12:31,644 INFO L286 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-04-29 11:12:31,644 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:31,645 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:31,645 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:32,183 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][175], [139#true, 77#L24-5true, 109#L25true, 173#true, Black: 148#(= |#race~data~0| 0), Black: 170#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), Black: 153#(= |ULTIMATE.start_main_~i~0#1| 0), 138#true, 7#L24-5true, 168#true, 127#L47-1true, 144#true, 142#true]) [2025-04-29 11:12:32,183 INFO L286 olderBase$Statistics]: this new event has 152 ancestors and is not cut-off event [2025-04-29 11:12:32,183 INFO L289 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-04-29 11:12:32,183 INFO L289 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-04-29 11:12:32,183 INFO L289 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-04-29 11:12:32,509 INFO L116 PetriNetUnfolderBase]: 19999/58027 cut-off events. [2025-04-29 11:12:32,509 INFO L117 PetriNetUnfolderBase]: For 9593/13615 co-relation queries the response was YES. [2025-04-29 11:12:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100953 conditions, 58027 events. 19999/58027 cut-off events. For 9593/13615 co-relation queries the response was YES. Maximal size of possible extension queue 1953. Compared 761141 event pairs, 9698 based on Foata normal form. 157/50891 useless extension candidates. Maximal degree in co-relation 79535. Up to 12713 conditions per place. [2025-04-29 11:12:32,946 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 58 selfloop transitions, 5 changer transitions 0/182 dead transitions. [2025-04-29 11:12:32,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 182 transitions, 640 flow [2025-04-29 11:12:32,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2025-04-29 11:12:32,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-04-29 11:12:32,947 INFO L175 Difference]: Start difference. First operand has 149 places, 151 transitions, 452 flow. Second operand 6 states and 700 transitions. [2025-04-29 11:12:32,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 182 transitions, 640 flow [2025-04-29 11:12:33,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 182 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:33,003 INFO L231 Difference]: Finished difference. Result has 151 places, 150 transitions, 438 flow [2025-04-29 11:12:33,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=151, PETRI_TRANSITIONS=150} [2025-04-29 11:12:33,003 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 8 predicate places. [2025-04-29 11:12:33,003 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 438 flow [2025-04-29 11:12:33,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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-04-29 11:12:33,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:33,004 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] [2025-04-29 11:12:33,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:12:33,004 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:33,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1555846950, now seen corresponding path program 1 times [2025-04-29 11:12:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:33,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888236553] [2025-04-29 11:12:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:33,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:12:33,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:12:33,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:12:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:33,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888236553] [2025-04-29 11:12:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888236553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:33,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357306457] [2025-04-29 11:12:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:33,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:33,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:33,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:33,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 139 [2025-04-29 11:12:33,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-04-29 11:12:33,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:33,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 139 [2025-04-29 11:12:33,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:35,656 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][171], [72#L24-6true, 139#true, 77#L24-5true, 173#true, Black: 148#(= |#race~data~0| 0), Black: 170#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 183#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 138#true, Black: 153#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L24-5true, 127#L47-1true, 144#true, 142#true]) [2025-04-29 11:12:35,656 INFO L286 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-04-29 11:12:35,656 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:35,656 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:35,656 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-29 11:12:35,994 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][170], [139#true, 77#L24-5true, 109#L25true, 173#true, Black: 148#(= |#race~data~0| 0), 183#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 170#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 138#true, Black: 153#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L24-5true, 127#L47-1true, 144#true, 142#true]) [2025-04-29 11:12:35,994 INFO L286 olderBase$Statistics]: this new event has 152 ancestors and is not cut-off event [2025-04-29 11:12:35,994 INFO L289 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-04-29 11:12:35,994 INFO L289 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-04-29 11:12:35,994 INFO L289 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-04-29 11:12:36,401 INFO L116 PetriNetUnfolderBase]: 10063/36472 cut-off events. [2025-04-29 11:12:36,401 INFO L117 PetriNetUnfolderBase]: For 6131/8102 co-relation queries the response was YES. [2025-04-29 11:12:36,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61441 conditions, 36472 events. 10063/36472 cut-off events. For 6131/8102 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 476629 event pairs, 5238 based on Foata normal form. 284/32607 useless extension candidates. Maximal degree in co-relation 31539. Up to 7614 conditions per place. [2025-04-29 11:12:36,581 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 47 selfloop transitions, 6 changer transitions 0/174 dead transitions. [2025-04-29 11:12:36,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 174 transitions, 606 flow [2025-04-29 11:12:36,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2025-04-29 11:12:36,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8561151079136691 [2025-04-29 11:12:36,582 INFO L175 Difference]: Start difference. First operand has 151 places, 150 transitions, 438 flow. Second operand 6 states and 714 transitions. [2025-04-29 11:12:36,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 174 transitions, 606 flow [2025-04-29 11:12:36,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 174 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:36,595 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 454 flow [2025-04-29 11:12:36,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=454, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2025-04-29 11:12:36,596 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 10 predicate places. [2025-04-29 11:12:36,596 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 454 flow [2025-04-29 11:12:36,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-04-29 11:12:36,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:36,596 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:36,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:12:36,596 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:36,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 872693656, now seen corresponding path program 1 times [2025-04-29 11:12:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:36,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531415152] [2025-04-29 11:12:36,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:36,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:12:36,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:12:36,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:36,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:12:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:36,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531415152] [2025-04-29 11:12:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531415152] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:36,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:36,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105202263] [2025-04-29 11:12:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:36,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:36,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:36,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:36,629 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 139 [2025-04-29 11:12:36,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-04-29 11:12:36,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:36,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 139 [2025-04-29 11:12:36,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:40,468 INFO L116 PetriNetUnfolderBase]: 11741/40876 cut-off events. [2025-04-29 11:12:40,468 INFO L117 PetriNetUnfolderBase]: For 22548/25657 co-relation queries the response was YES. [2025-04-29 11:12:40,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76765 conditions, 40876 events. 11741/40876 cut-off events. For 22548/25657 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 557764 event pairs, 6051 based on Foata normal form. 47/36744 useless extension candidates. Maximal degree in co-relation 29536. Up to 13416 conditions per place. [2025-04-29 11:12:40,670 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 43 selfloop transitions, 18 changer transitions 0/177 dead transitions. [2025-04-29 11:12:40,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 177 transitions, 699 flow [2025-04-29 11:12:40,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-04-29 11:12:40,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9160671462829736 [2025-04-29 11:12:40,671 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 454 flow. Second operand 3 states and 382 transitions. [2025-04-29 11:12:40,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 177 transitions, 699 flow [2025-04-29 11:12:40,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 177 transitions, 691 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:40,678 INFO L231 Difference]: Finished difference. Result has 154 places, 166 transitions, 624 flow [2025-04-29 11:12:40,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=154, PETRI_TRANSITIONS=166} [2025-04-29 11:12:40,679 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places. [2025-04-29 11:12:40,679 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 166 transitions, 624 flow [2025-04-29 11:12:40,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-04-29 11:12:40,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:40,679 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:40,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:12:40,679 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:40,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1666395148, now seen corresponding path program 1 times [2025-04-29 11:12:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:40,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244311168] [2025-04-29 11:12:40,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:40,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:12:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:12:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:12:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:40,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244311168] [2025-04-29 11:12:40,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244311168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:40,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:12:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061000385] [2025-04-29 11:12:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:40,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:40,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:40,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:40,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-04-29 11:12:40,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 166 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-04-29 11:12:40,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:40,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-04-29 11:12:40,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:41,152 INFO L116 PetriNetUnfolderBase]: 688/6741 cut-off events. [2025-04-29 11:12:41,152 INFO L117 PetriNetUnfolderBase]: For 3175/3627 co-relation queries the response was YES. [2025-04-29 11:12:41,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11135 conditions, 6741 events. 688/6741 cut-off events. For 3175/3627 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 77327 event pairs, 149 based on Foata normal form. 177/6533 useless extension candidates. Maximal degree in co-relation 4490. Up to 662 conditions per place. [2025-04-29 11:12:41,183 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 16 selfloop transitions, 8 changer transitions 0/156 dead transitions. [2025-04-29 11:12:41,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 156 transitions, 557 flow [2025-04-29 11:12:41,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-04-29 11:12:41,184 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9376498800959233 [2025-04-29 11:12:41,184 INFO L175 Difference]: Start difference. First operand has 154 places, 166 transitions, 624 flow. Second operand 3 states and 391 transitions. [2025-04-29 11:12:41,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 156 transitions, 557 flow [2025-04-29 11:12:41,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 156 transitions, 543 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:41,192 INFO L231 Difference]: Finished difference. Result has 154 places, 149 transitions, 464 flow [2025-04-29 11:12:41,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=154, PETRI_TRANSITIONS=149} [2025-04-29 11:12:41,193 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places. [2025-04-29 11:12:41,193 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 149 transitions, 464 flow [2025-04-29 11:12:41,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-04-29 11:12:41,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:41,193 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:41,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:12:41,194 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:41,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1655292466, now seen corresponding path program 1 times [2025-04-29 11:12:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:41,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198356221] [2025-04-29 11:12:41,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:41,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-29 11:12:41,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 11:12:41,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:41,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:12:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:41,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198356221] [2025-04-29 11:12:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198356221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898984466] [2025-04-29 11:12:41,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:41,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:41,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:41,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 139 [2025-04-29 11:12:41,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 149 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-04-29 11:12:41,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:41,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 139 [2025-04-29 11:12:41,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:41,817 INFO L116 PetriNetUnfolderBase]: 1114/7733 cut-off events. [2025-04-29 11:12:41,817 INFO L117 PetriNetUnfolderBase]: For 6474/6635 co-relation queries the response was YES. [2025-04-29 11:12:41,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14920 conditions, 7733 events. 1114/7733 cut-off events. For 6474/6635 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 92403 event pairs, 714 based on Foata normal form. 7/7216 useless extension candidates. Maximal degree in co-relation 11768. Up to 2065 conditions per place. [2025-04-29 11:12:41,845 INFO L140 encePairwiseOnDemand]: 134/139 looper letters, 33 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-04-29 11:12:41,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 156 transitions, 578 flow [2025-04-29 11:12:41,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-04-29 11:12:41,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8920863309352518 [2025-04-29 11:12:41,846 INFO L175 Difference]: Start difference. First operand has 154 places, 149 transitions, 464 flow. Second operand 3 states and 372 transitions. [2025-04-29 11:12:41,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 156 transitions, 578 flow [2025-04-29 11:12:41,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 156 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:12:41,850 INFO L231 Difference]: Finished difference. Result has 157 places, 152 transitions, 496 flow [2025-04-29 11:12:41,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=157, PETRI_TRANSITIONS=152} [2025-04-29 11:12:41,850 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 14 predicate places. [2025-04-29 11:12:41,850 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 152 transitions, 496 flow [2025-04-29 11:12:41,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-04-29 11:12:41,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:41,850 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:41,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:12:41,851 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:41,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1450036217, now seen corresponding path program 1 times [2025-04-29 11:12:41,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:41,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678881210] [2025-04-29 11:12:41,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:41,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:41,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-29 11:12:41,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-29 11:12:41,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:41,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:12:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:41,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678881210] [2025-04-29 11:12:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678881210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:41,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389389778] [2025-04-29 11:12:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:41,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:41,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:41,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:41,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 139 [2025-04-29 11:12:41,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 152 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-04-29 11:12:41,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:41,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 139 [2025-04-29 11:12:41,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:42,471 INFO L116 PetriNetUnfolderBase]: 1121/8019 cut-off events. [2025-04-29 11:12:42,471 INFO L117 PetriNetUnfolderBase]: For 8672/8824 co-relation queries the response was YES. [2025-04-29 11:12:42,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15942 conditions, 8019 events. 1121/8019 cut-off events. For 8672/8824 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 96591 event pairs, 707 based on Foata normal form. 4/7566 useless extension candidates. Maximal degree in co-relation 12796. Up to 2095 conditions per place. [2025-04-29 11:12:42,507 INFO L140 encePairwiseOnDemand]: 134/139 looper letters, 33 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-04-29 11:12:42,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 158 transitions, 601 flow [2025-04-29 11:12:42,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-04-29 11:12:42,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8896882494004796 [2025-04-29 11:12:42,508 INFO L175 Difference]: Start difference. First operand has 157 places, 152 transitions, 496 flow. Second operand 3 states and 371 transitions. [2025-04-29 11:12:42,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 158 transitions, 601 flow [2025-04-29 11:12:42,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 587 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:42,515 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 524 flow [2025-04-29 11:12:42,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2025-04-29 11:12:42,515 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 16 predicate places. [2025-04-29 11:12:42,515 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 524 flow [2025-04-29 11:12:42,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-04-29 11:12:42,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:42,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:12:42,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:12:42,516 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:42,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1264981292, now seen corresponding path program 1 times [2025-04-29 11:12:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:42,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054347305] [2025-04-29 11:12:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:42,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:12:42,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:12:42,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:12:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:42,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054347305] [2025-04-29 11:12:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054347305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:12:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883693262] [2025-04-29 11:12:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:42,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:12:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:42,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:12:42,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:12:42,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 139 [2025-04-29 11:12:42,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 524 flow. Second operand has 9 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 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-04-29 11:12:42,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:42,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 139 [2025-04-29 11:12:42,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:43,810 INFO L116 PetriNetUnfolderBase]: 2202/9522 cut-off events. [2025-04-29 11:12:43,810 INFO L117 PetriNetUnfolderBase]: For 4750/4898 co-relation queries the response was YES. [2025-04-29 11:12:43,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18104 conditions, 9522 events. 2202/9522 cut-off events. For 4750/4898 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 99227 event pairs, 430 based on Foata normal form. 110/9412 useless extension candidates. Maximal degree in co-relation 8700. Up to 1508 conditions per place. [2025-04-29 11:12:43,861 INFO L140 encePairwiseOnDemand]: 125/139 looper letters, 82 selfloop transitions, 15 changer transitions 21/237 dead transitions. [2025-04-29 11:12:43,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 237 transitions, 1009 flow [2025-04-29 11:12:43,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:12:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:12:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1484 transitions. [2025-04-29 11:12:43,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8212506917542889 [2025-04-29 11:12:43,863 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 524 flow. Second operand 13 states and 1484 transitions. [2025-04-29 11:12:43,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 237 transitions, 1009 flow [2025-04-29 11:12:43,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 237 transitions, 993 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:43,873 INFO L231 Difference]: Finished difference. Result has 178 places, 162 transitions, 600 flow [2025-04-29 11:12:43,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=600, PETRI_PLACES=178, PETRI_TRANSITIONS=162} [2025-04-29 11:12:43,873 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 35 predicate places. [2025-04-29 11:12:43,873 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 162 transitions, 600 flow [2025-04-29 11:12:43,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 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-04-29 11:12:43,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:43,874 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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-04-29 11:12:43,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:12:43,874 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:43,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 370079671, now seen corresponding path program 1 times [2025-04-29 11:12:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:43,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679022249] [2025-04-29 11:12:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:43,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-29 11:12:43,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-29 11:12:43,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:43,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:43,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:43,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-29 11:12:43,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-29 11:12:43,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:43,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:43,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:43,911 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:12:43,911 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:12:43,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:12:43,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:43,912 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:12:43,912 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-29 11:12:43,932 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-29 11:12:43,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 157 transitions, 369 flow [2025-04-29 11:12:44,037 INFO L116 PetriNetUnfolderBase]: 55/1004 cut-off events. [2025-04-29 11:12:44,037 INFO L117 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-04-29 11:12:44,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 1004 events. 55/1004 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4844 event pairs, 23 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 612. Up to 80 conditions per place. [2025-04-29 11:12:44,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 157 transitions, 369 flow [2025-04-29 11:12:44,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 157 transitions, 369 flow [2025-04-29 11:12:44,043 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:44,044 INFO L340 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;@685644a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:44,044 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-29 11:12:44,046 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:44,046 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:12:44,046 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:44,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:44,046 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] [2025-04-29 11:12:44,046 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:12:44,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1551201655, now seen corresponding path program 1 times [2025-04-29 11:12:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:44,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069546971] [2025-04-29 11:12:44,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:44,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:44,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:44,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:44,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:44,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069546971] [2025-04-29 11:12:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069546971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:44,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575299683] [2025-04-29 11:12:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:44,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:44,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:44,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:44,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 157 [2025-04-29 11:12:44,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-04-29 11:12:44,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:44,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 157 [2025-04-29 11:12:44,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:57,062 INFO L116 PetriNetUnfolderBase]: 51883/132978 cut-off events. [2025-04-29 11:12:57,062 INFO L117 PetriNetUnfolderBase]: For 14970/15966 co-relation queries the response was YES. [2025-04-29 11:12:57,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208283 conditions, 132978 events. 51883/132978 cut-off events. For 14970/15966 co-relation queries the response was YES. Maximal size of possible extension queue 3386. Compared 1792769 event pairs, 29580 based on Foata normal form. 1/121661 useless extension candidates. Maximal degree in co-relation 165922. Up to 48608 conditions per place. [2025-04-29 11:12:57,853 INFO L140 encePairwiseOnDemand]: 148/157 looper letters, 37 selfloop transitions, 7 changer transitions 1/172 dead transitions. [2025-04-29 11:12:57,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 172 transitions, 487 flow [2025-04-29 11:12:57,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2025-04-29 11:12:57,854 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9129511677282378 [2025-04-29 11:12:57,854 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 369 flow. Second operand 3 states and 430 transitions. [2025-04-29 11:12:57,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 172 transitions, 487 flow [2025-04-29 11:12:57,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 172 transitions, 487 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:57,878 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 419 flow [2025-04-29 11:12:57,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-04-29 11:12:57,879 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 4 predicate places. [2025-04-29 11:12:57,879 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 419 flow [2025-04-29 11:12:57,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-04-29 11:12:57,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:57,879 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] [2025-04-29 11:12:57,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-29 11:12:57,879 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:12:57,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2114636451, now seen corresponding path program 1 times [2025-04-29 11:12:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:57,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65399157] [2025-04-29 11:12:57,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:57,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:57,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:57,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:57,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:57,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65399157] [2025-04-29 11:12:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65399157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:57,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435326692] [2025-04-29 11:12:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:57,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:57,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:57,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:57,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 157 [2025-04-29 11:12:57,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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-04-29 11:12:57,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:57,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 157 [2025-04-29 11:12:57,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15