./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12-pthread.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:02:09,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:02:09,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:02:09,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:02:09,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:02:09,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:02:09,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:02:09,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:02:09,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:02:09,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:02:09,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:02:09,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:02:09,649 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:02:09,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:02:09,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:02:09,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:02:09,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:02:09,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:02:09,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:02:09,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:02:09,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:02:09,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:02:09,654 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:02:09,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:02:09,655 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:02:09,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:02:09,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:02:09,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:02:09,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:02:09,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:02:09,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:02:09,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:09,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:02:09,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:02:09,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:02:09,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:02:09,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:02:09,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:02:09,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:02:09,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:02:09,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:02:09,659 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2024-10-11 17:02:09,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:02:09,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:02:09,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:02:09,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:02:09,891 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:02:09,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12-pthread.i [2024-10-11 17:02:11,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:02:11,519 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:02:11,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12-pthread.i [2024-10-11 17:02:11,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d7c99e95/add01e6697fb4440a01a8f668d4027d1/FLAG40e22cbf0 [2024-10-11 17:02:11,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d7c99e95/add01e6697fb4440a01a8f668d4027d1 [2024-10-11 17:02:11,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:02:11,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:02:11,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:11,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:02:11,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:02:11,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:11" (1/1) ... [2024-10-11 17:02:11,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f401d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:11, skipping insertion in model container [2024-10-11 17:02:11,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:11" (1/1) ... [2024-10-11 17:02:11,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:02:12,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:12,120 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:02:12,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:12,210 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:02:12,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12 WrapperNode [2024-10-11 17:02:12,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:12,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:12,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:02:12,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:02:12,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,272 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2024-10-11 17:02:12,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:12,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:02:12,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:02:12,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:02:12,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:02:12,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:02:12,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:02:12,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:02:12,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:12,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:02:12,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:02:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:02:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-10-11 17:02:12,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-10-11 17:02:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:02:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:02:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:02:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:02:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:02:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:02:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:02:12,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:02:12,393 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:02:12,524 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:02:12,525 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:02:12,717 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:02:12,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:02:12,746 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:02:12,746 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:02:12,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:12 BoogieIcfgContainer [2024-10-11 17:02:12,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:02:12,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:02:12,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:02:12,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:02:12,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:11" (1/3) ... [2024-10-11 17:02:12,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cabf342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:12, skipping insertion in model container [2024-10-11 17:02:12,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12" (2/3) ... [2024-10-11 17:02:12,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cabf342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:12, skipping insertion in model container [2024-10-11 17:02:12,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:12" (3/3) ... [2024-10-11 17:02:12,763 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12-pthread.i [2024-10-11 17:02:12,781 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:02:12,781 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 17:02:12,781 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:02:12,830 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:12,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 148 transitions, 300 flow [2024-10-11 17:02:12,908 INFO L124 PetriNetUnfolderBase]: 10/158 cut-off events. [2024-10-11 17:02:12,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:12,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 10/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 151 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-10-11 17:02:12,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 148 transitions, 300 flow [2024-10-11 17:02:12,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 148 transitions, 300 flow [2024-10-11 17:02:12,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:12,939 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7770dab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:12,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-10-11 17:02:12,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:12,951 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:02:12,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:12,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:12,952 INFO L204 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] [2024-10-11 17:02:12,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-10-11 17:02:12,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash -539149206, now seen corresponding path program 1 times [2024-10-11 17:02:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042772809] [2024-10-11 17:02:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:13,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042772809] [2024-10-11 17:02:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042772809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:13,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11285401] [2024-10-11 17:02:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:13,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:13,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148 [2024-10-11 17:02:13,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 148 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2024-10-11 17:02:13,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:13,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148 [2024-10-11 17:02:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:13,260 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2024-10-11 17:02:13,260 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:13,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 139 events. 4/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 12/132 useless extension candidates. Maximal degree in co-relation 77. Up to 11 conditions per place. [2024-10-11 17:02:13,262 INFO L140 encePairwiseOnDemand]: 139/148 looper letters, 10 selfloop transitions, 2 changer transitions 1/135 dead transitions. [2024-10-11 17:02:13,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 298 flow [2024-10-11 17:02:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2024-10-11 17:02:13,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009009009009009 [2024-10-11 17:02:13,282 INFO L175 Difference]: Start difference. First operand has 142 places, 148 transitions, 300 flow. Second operand 3 states and 400 transitions. [2024-10-11 17:02:13,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 298 flow [2024-10-11 17:02:13,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:13,327 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 276 flow [2024-10-11 17:02:13,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2024-10-11 17:02:13,334 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, -6 predicate places. [2024-10-11 17:02:13,336 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 276 flow [2024-10-11 17:02:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2024-10-11 17:02:13,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:13,337 INFO L204 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] [2024-10-11 17:02:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:02:13,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-10-11 17:02:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 937370990, now seen corresponding path program 1 times [2024-10-11 17:02:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530034598] [2024-10-11 17:02:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530034598] [2024-10-11 17:02:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530034598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688199197] [2024-10-11 17:02:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:13,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 148 [2024-10-11 17:02:13,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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) [2024-10-11 17:02:13,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:13,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 148 [2024-10-11 17:02:13,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:13,469 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2024-10-11 17:02:13,469 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:13,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2024-10-11 17:02:13,470 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 11 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-10-11 17:02:13,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 133 transitions, 300 flow [2024-10-11 17:02:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2024-10-11 17:02:13,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828828828828829 [2024-10-11 17:02:13,473 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 276 flow. Second operand 3 states and 392 transitions. [2024-10-11 17:02:13,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 133 transitions, 300 flow [2024-10-11 17:02:13,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:13,477 INFO L231 Difference]: Finished difference. Result has 134 places, 133 transitions, 274 flow [2024-10-11 17:02:13,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=134, PETRI_TRANSITIONS=133} [2024-10-11 17:02:13,478 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, -8 predicate places. [2024-10-11 17:02:13,478 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 133 transitions, 274 flow [2024-10-11 17:02:13,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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) [2024-10-11 17:02:13,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:13,479 INFO L204 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] [2024-10-11 17:02:13,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:02:13,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-10-11 17:02:13,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1079100034, now seen corresponding path program 1 times [2024-10-11 17:02:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411256308] [2024-10-11 17:02:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411256308] [2024-10-11 17:02:13,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411256308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:13,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:13,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545285155] [2024-10-11 17:02:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:13,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:13,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:13,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:13,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:13,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 148 [2024-10-11 17:02:13,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2024-10-11 17:02:13,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:13,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 148 [2024-10-11 17:02:13,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:13,596 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2024-10-11 17:02:13,598 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:13,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 132 events. 4/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2024-10-11 17:02:13,599 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 13 selfloop transitions, 1 changer transitions 0/128 dead transitions. [2024-10-11 17:02:13,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 128 transitions, 292 flow [2024-10-11 17:02:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2024-10-11 17:02:13,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8671171171171171 [2024-10-11 17:02:13,602 INFO L175 Difference]: Start difference. First operand has 134 places, 133 transitions, 274 flow. Second operand 3 states and 385 transitions. [2024-10-11 17:02:13,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 128 transitions, 292 flow [2024-10-11 17:02:13,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 128 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:13,606 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 262 flow [2024-10-11 17:02:13,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2024-10-11 17:02:13,608 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, -13 predicate places. [2024-10-11 17:02:13,608 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 262 flow [2024-10-11 17:02:13,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2024-10-11 17:02:13,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:13,609 INFO L204 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] [2024-10-11 17:02:13,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:02:13,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-10-11 17:02:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1376072315, now seen corresponding path program 1 times [2024-10-11 17:02:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491973401] [2024-10-11 17:02:13,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491973401] [2024-10-11 17:02:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491973401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086410690] [2024-10-11 17:02:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:13,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:13,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 148 [2024-10-11 17:02:13,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2024-10-11 17:02:13,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:13,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 148 [2024-10-11 17:02:13,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:13,704 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2024-10-11 17:02:13,704 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:13,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 131 events. 4/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 108. Up to 8 conditions per place. [2024-10-11 17:02:13,705 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 7 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-10-11 17:02:13,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 278 flow [2024-10-11 17:02:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2024-10-11 17:02:13,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009009009009009 [2024-10-11 17:02:13,707 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 262 flow. Second operand 3 states and 400 transitions. [2024-10-11 17:02:13,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 278 flow [2024-10-11 17:02:13,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:13,712 INFO L231 Difference]: Finished difference. Result has 129 places, 127 transitions, 263 flow [2024-10-11 17:02:13,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=129, PETRI_TRANSITIONS=127} [2024-10-11 17:02:13,713 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, -13 predicate places. [2024-10-11 17:02:13,713 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 127 transitions, 263 flow [2024-10-11 17:02:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2024-10-11 17:02:13,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:13,715 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-11 17:02:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:02:13,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-10-11 17:02:13,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 257726207, now seen corresponding path program 1 times [2024-10-11 17:02:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837514766] [2024-10-11 17:02:13,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:02:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837514766] [2024-10-11 17:02:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837514766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121675236] [2024-10-11 17:02:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:13,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 148 [2024-10-11 17:02:13,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 127 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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) [2024-10-11 17:02:13,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:13,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 148 [2024-10-11 17:02:13,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:13,947 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2024-10-11 17:02:13,948 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:13,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 134 events. 3/134 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 122. Up to 15 conditions per place. [2024-10-11 17:02:13,948 INFO L140 encePairwiseOnDemand]: 144/148 looper letters, 14 selfloop transitions, 0 changer transitions 4/130 dead transitions. [2024-10-11 17:02:13,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 130 transitions, 305 flow [2024-10-11 17:02:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2024-10-11 17:02:13,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8635135135135135 [2024-10-11 17:02:13,977 INFO L175 Difference]: Start difference. First operand has 129 places, 127 transitions, 263 flow. Second operand 5 states and 639 transitions. [2024-10-11 17:02:13,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 130 transitions, 305 flow [2024-10-11 17:02:13,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:13,981 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 263 flow [2024-10-11 17:02:13,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2024-10-11 17:02:13,982 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, -8 predicate places. [2024-10-11 17:02:13,982 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 263 flow [2024-10-11 17:02:13,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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) [2024-10-11 17:02:13,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:13,983 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-11 17:02:13,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:02:13,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-10-11 17:02:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -101692708, now seen corresponding path program 1 times [2024-10-11 17:02:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424661560] [2024-10-11 17:02:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:14,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:14,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:14,039 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:14,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2024-10-11 17:02:14,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2024-10-11 17:02:14,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2024-10-11 17:02:14,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2024-10-11 17:02:14,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2024-10-11 17:02:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2024-10-11 17:02:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2024-10-11 17:02:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2024-10-11 17:02:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2024-10-11 17:02:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2024-10-11 17:02:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2024-10-11 17:02:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2024-10-11 17:02:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2024-10-11 17:02:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2024-10-11 17:02:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2024-10-11 17:02:14,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2024-10-11 17:02:14,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2024-10-11 17:02:14,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2024-10-11 17:02:14,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2024-10-11 17:02:14,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2024-10-11 17:02:14,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2024-10-11 17:02:14,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2024-10-11 17:02:14,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2024-10-11 17:02:14,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:02:14,047 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 17:02:14,049 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:14,049 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:02:14,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:14,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 219 transitions, 448 flow [2024-10-11 17:02:14,115 INFO L124 PetriNetUnfolderBase]: 17/241 cut-off events. [2024-10-11 17:02:14,115 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:14,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 241 events. 17/241 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 519 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 159. Up to 6 conditions per place. [2024-10-11 17:02:14,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 219 transitions, 448 flow [2024-10-11 17:02:14,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 219 transitions, 448 flow [2024-10-11 17:02:14,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:14,122 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7770dab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:14,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-11 17:02:14,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:14,125 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:02:14,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:14,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:14,125 INFO L204 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] [2024-10-11 17:02:14,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:14,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash -169305051, now seen corresponding path program 1 times [2024-10-11 17:02:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:14,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434940579] [2024-10-11 17:02:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:14,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434940579] [2024-10-11 17:02:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434940579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:14,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081108490] [2024-10-11 17:02:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:14,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:14,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:14,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 219 [2024-10-11 17:02:14,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 219 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 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) [2024-10-11 17:02:14,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:14,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 219 [2024-10-11 17:02:14,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:14,434 INFO L124 PetriNetUnfolderBase]: 70/673 cut-off events. [2024-10-11 17:02:14,435 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-11 17:02:14,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 673 events. 70/673 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3835 event pairs, 42 based on Foata normal form. 99/657 useless extension candidates. Maximal degree in co-relation 616. Up to 102 conditions per place. [2024-10-11 17:02:14,446 INFO L140 encePairwiseOnDemand]: 207/219 looper letters, 17 selfloop transitions, 2 changer transitions 1/201 dead transitions. [2024-10-11 17:02:14,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 201 transitions, 450 flow [2024-10-11 17:02:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2024-10-11 17:02:14,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898021308980213 [2024-10-11 17:02:14,451 INFO L175 Difference]: Start difference. First operand has 209 places, 219 transitions, 448 flow. Second operand 3 states and 590 transitions. [2024-10-11 17:02:14,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 201 transitions, 450 flow [2024-10-11 17:02:14,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 201 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:14,458 INFO L231 Difference]: Finished difference. Result has 201 places, 200 transitions, 414 flow [2024-10-11 17:02:14,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=201, PETRI_TRANSITIONS=200} [2024-10-11 17:02:14,463 INFO L277 CegarLoopForPetriNet]: 209 programPoint places, -8 predicate places. [2024-10-11 17:02:14,463 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 200 transitions, 414 flow [2024-10-11 17:02:14,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 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) [2024-10-11 17:02:14,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:14,464 INFO L204 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] [2024-10-11 17:02:14,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:02:14,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:14,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2085246962, now seen corresponding path program 1 times [2024-10-11 17:02:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436490080] [2024-10-11 17:02:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:14,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436490080] [2024-10-11 17:02:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436490080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:14,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070655173] [2024-10-11 17:02:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:14,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:14,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 219 [2024-10-11 17:02:14,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 200 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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) [2024-10-11 17:02:14,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:14,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 219 [2024-10-11 17:02:14,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:14,637 INFO L124 PetriNetUnfolderBase]: 42/529 cut-off events. [2024-10-11 17:02:14,638 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-11 17:02:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 529 events. 42/529 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2585 event pairs, 20 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 579. Up to 57 conditions per place. [2024-10-11 17:02:14,641 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 16 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-10-11 17:02:14,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 199 transitions, 448 flow [2024-10-11 17:02:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2024-10-11 17:02:14,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873668188736682 [2024-10-11 17:02:14,643 INFO L175 Difference]: Start difference. First operand has 201 places, 200 transitions, 414 flow. Second operand 3 states and 583 transitions. [2024-10-11 17:02:14,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 199 transitions, 448 flow [2024-10-11 17:02:14,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 199 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:14,646 INFO L231 Difference]: Finished difference. Result has 199 places, 199 transitions, 412 flow [2024-10-11 17:02:14,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=199, PETRI_TRANSITIONS=199} [2024-10-11 17:02:14,647 INFO L277 CegarLoopForPetriNet]: 209 programPoint places, -10 predicate places. [2024-10-11 17:02:14,649 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 199 transitions, 412 flow [2024-10-11 17:02:14,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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) [2024-10-11 17:02:14,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:14,650 INFO L204 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] [2024-10-11 17:02:14,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:02:14,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -498281502, now seen corresponding path program 1 times [2024-10-11 17:02:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491320934] [2024-10-11 17:02:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:14,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491320934] [2024-10-11 17:02:14,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491320934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343538148] [2024-10-11 17:02:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:14,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:14,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:14,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 219 [2024-10-11 17:02:14,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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) [2024-10-11 17:02:14,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:14,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 219 [2024-10-11 17:02:14,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:14,825 INFO L124 PetriNetUnfolderBase]: 82/811 cut-off events. [2024-10-11 17:02:14,825 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 17:02:14,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 811 events. 82/811 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4772 event pairs, 42 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 911. Up to 109 conditions per place. [2024-10-11 17:02:14,829 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 20 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2024-10-11 17:02:14,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 192 transitions, 440 flow [2024-10-11 17:02:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2024-10-11 17:02:14,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8645357686453576 [2024-10-11 17:02:14,831 INFO L175 Difference]: Start difference. First operand has 199 places, 199 transitions, 412 flow. Second operand 3 states and 568 transitions. [2024-10-11 17:02:14,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 192 transitions, 440 flow [2024-10-11 17:02:14,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 192 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:14,834 INFO L231 Difference]: Finished difference. Result has 192 places, 192 transitions, 396 flow [2024-10-11 17:02:14,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=192, PETRI_TRANSITIONS=192} [2024-10-11 17:02:14,835 INFO L277 CegarLoopForPetriNet]: 209 programPoint places, -17 predicate places. [2024-10-11 17:02:14,836 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 192 transitions, 396 flow [2024-10-11 17:02:14,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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) [2024-10-11 17:02:14,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:14,836 INFO L204 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] [2024-10-11 17:02:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:02:14,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1518551333, now seen corresponding path program 1 times [2024-10-11 17:02:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672308956] [2024-10-11 17:02:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672308956] [2024-10-11 17:02:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672308956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:14,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682629937] [2024-10-11 17:02:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:14,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:14,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 219 [2024-10-11 17:02:14,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 192 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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) [2024-10-11 17:02:14,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:14,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 219 [2024-10-11 17:02:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:14,944 INFO L124 PetriNetUnfolderBase]: 31/445 cut-off events. [2024-10-11 17:02:14,945 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:02:14,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 445 events. 31/445 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1864 event pairs, 12 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 462. Up to 36 conditions per place. [2024-10-11 17:02:14,948 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 11 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2024-10-11 17:02:14,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 420 flow [2024-10-11 17:02:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2024-10-11 17:02:14,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9025875190258752 [2024-10-11 17:02:14,950 INFO L175 Difference]: Start difference. First operand has 192 places, 192 transitions, 396 flow. Second operand 3 states and 593 transitions. [2024-10-11 17:02:14,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 420 flow [2024-10-11 17:02:14,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 191 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:14,953 INFO L231 Difference]: Finished difference. Result has 192 places, 191 transitions, 397 flow [2024-10-11 17:02:14,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=192, PETRI_TRANSITIONS=191} [2024-10-11 17:02:14,954 INFO L277 CegarLoopForPetriNet]: 209 programPoint places, -17 predicate places. [2024-10-11 17:02:14,955 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 191 transitions, 397 flow [2024-10-11 17:02:14,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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) [2024-10-11 17:02:14,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:14,955 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:14,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:02:14,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:14,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1948651562, now seen corresponding path program 1 times [2024-10-11 17:02:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591602601] [2024-10-11 17:02:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:14,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591602601] [2024-10-11 17:02:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591602601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094365819] [2024-10-11 17:02:15,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 219 [2024-10-11 17:02:15,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 191 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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) [2024-10-11 17:02:15,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 219 [2024-10-11 17:02:15,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,218 INFO L124 PetriNetUnfolderBase]: 195/1598 cut-off events. [2024-10-11 17:02:15,218 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:02:15,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1598 events. 195/1598 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12576 event pairs, 57 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 1888. Up to 204 conditions per place. [2024-10-11 17:02:15,228 INFO L140 encePairwiseOnDemand]: 199/219 looper letters, 32 selfloop transitions, 14 changer transitions 0/210 dead transitions. [2024-10-11 17:02:15,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 210 transitions, 532 flow [2024-10-11 17:02:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2024-10-11 17:02:15,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056316590563166 [2024-10-11 17:02:15,231 INFO L175 Difference]: Start difference. First operand has 192 places, 191 transitions, 397 flow. Second operand 3 states and 595 transitions. [2024-10-11 17:02:15,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 210 transitions, 532 flow [2024-10-11 17:02:15,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 210 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:15,269 INFO L231 Difference]: Finished difference. Result has 194 places, 205 transitions, 517 flow [2024-10-11 17:02:15,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=194, PETRI_TRANSITIONS=205} [2024-10-11 17:02:15,270 INFO L277 CegarLoopForPetriNet]: 209 programPoint places, -15 predicate places. [2024-10-11 17:02:15,270 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 205 transitions, 517 flow [2024-10-11 17:02:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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) [2024-10-11 17:02:15,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,271 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2024-10-11 17:02:15,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:02:15,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 110521077, now seen corresponding path program 1 times [2024-10-11 17:02:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360757960] [2024-10-11 17:02:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:02:15,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360757960] [2024-10-11 17:02:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360757960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412265501] [2024-10-11 17:02:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:15,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 219 [2024-10-11 17:02:15,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 205 transitions, 517 flow. Second operand has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 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) [2024-10-11 17:02:15,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 219 [2024-10-11 17:02:15,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,521 INFO L124 PetriNetUnfolderBase]: 130/1495 cut-off events. [2024-10-11 17:02:15,522 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-11 17:02:15,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1495 events. 130/1495 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11577 event pairs, 41 based on Foata normal form. 1/1300 useless extension candidates. Maximal degree in co-relation 1727. Up to 120 conditions per place. [2024-10-11 17:02:15,532 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 17 selfloop transitions, 0 changer transitions 4/208 dead transitions. [2024-10-11 17:02:15,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 208 transitions, 565 flow [2024-10-11 17:02:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 962 transitions. [2024-10-11 17:02:15,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8785388127853881 [2024-10-11 17:02:15,534 INFO L175 Difference]: Start difference. First operand has 194 places, 205 transitions, 517 flow. Second operand 5 states and 962 transitions. [2024-10-11 17:02:15,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 208 transitions, 565 flow [2024-10-11 17:02:15,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 208 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:15,539 INFO L231 Difference]: Finished difference. Result has 199 places, 204 transitions, 493 flow [2024-10-11 17:02:15,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=493, PETRI_PLACES=199, PETRI_TRANSITIONS=204} [2024-10-11 17:02:15,540 INFO L277 CegarLoopForPetriNet]: 209 programPoint places, -10 predicate places. [2024-10-11 17:02:15,540 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 204 transitions, 493 flow [2024-10-11 17:02:15,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 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) [2024-10-11 17:02:15,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,541 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2024-10-11 17:02:15,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:02:15,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-10-11 17:02:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 472091293, now seen corresponding path program 1 times [2024-10-11 17:02:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139107822] [2024-10-11 17:02:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:15,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:15,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:15,566 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:15,566 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2024-10-11 17:02:15,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2024-10-11 17:02:15,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2024-10-11 17:02:15,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2024-10-11 17:02:15,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2024-10-11 17:02:15,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2024-10-11 17:02:15,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2024-10-11 17:02:15,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2024-10-11 17:02:15,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:02:15,570 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:15,570 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:15,570 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:02:15,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:15,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 290 transitions, 598 flow [2024-10-11 17:02:15,692 INFO L124 PetriNetUnfolderBase]: 24/324 cut-off events. [2024-10-11 17:02:15,693 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:02:15,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 324 events. 24/324 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 958 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 245. Up to 8 conditions per place. [2024-10-11 17:02:15,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 290 transitions, 598 flow [2024-10-11 17:02:15,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 290 transitions, 598 flow [2024-10-11 17:02:15,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:15,707 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7770dab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:15,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-10-11 17:02:15,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:15,708 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:02:15,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:15,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,708 INFO L204 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] [2024-10-11 17:02:15,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:15,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 614618759, now seen corresponding path program 1 times [2024-10-11 17:02:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255598840] [2024-10-11 17:02:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:15,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255598840] [2024-10-11 17:02:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255598840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600038749] [2024-10-11 17:02:15,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 290 [2024-10-11 17:02:15,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 290 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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) [2024-10-11 17:02:15,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 290 [2024-10-11 17:02:15,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,409 INFO L124 PetriNetUnfolderBase]: 829/4693 cut-off events. [2024-10-11 17:02:16,410 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-10-11 17:02:16,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 4693 events. 829/4693 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 48192 event pairs, 630 based on Foata normal form. 847/4741 useless extension candidates. Maximal degree in co-relation 4863. Up to 1033 conditions per place. [2024-10-11 17:02:16,461 INFO L140 encePairwiseOnDemand]: 275/290 looper letters, 24 selfloop transitions, 2 changer transitions 1/267 dead transitions. [2024-10-11 17:02:16,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 267 transitions, 604 flow [2024-10-11 17:02:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2024-10-11 17:02:16,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.896551724137931 [2024-10-11 17:02:16,466 INFO L175 Difference]: Start difference. First operand has 276 places, 290 transitions, 598 flow. Second operand 3 states and 780 transitions. [2024-10-11 17:02:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 267 transitions, 604 flow [2024-10-11 17:02:16,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 602 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:16,470 INFO L231 Difference]: Finished difference. Result has 266 places, 266 transitions, 552 flow [2024-10-11 17:02:16,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=266, PETRI_TRANSITIONS=266} [2024-10-11 17:02:16,472 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -10 predicate places. [2024-10-11 17:02:16,472 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 266 transitions, 552 flow [2024-10-11 17:02:16,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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) [2024-10-11 17:02:16,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,473 INFO L204 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] [2024-10-11 17:02:16,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:02:16,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:16,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1305819086, now seen corresponding path program 1 times [2024-10-11 17:02:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366337690] [2024-10-11 17:02:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366337690] [2024-10-11 17:02:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366337690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29065970] [2024-10-11 17:02:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 290 [2024-10-11 17:02:16,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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) [2024-10-11 17:02:16,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 290 [2024-10-11 17:02:16,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,823 INFO L124 PetriNetUnfolderBase]: 335/2601 cut-off events. [2024-10-11 17:02:16,824 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-10-11 17:02:16,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 2601 events. 335/2601 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 23488 event pairs, 220 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3051. Up to 382 conditions per place. [2024-10-11 17:02:16,846 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 21 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-10-11 17:02:16,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 596 flow [2024-10-11 17:02:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2024-10-11 17:02:16,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896551724137931 [2024-10-11 17:02:16,848 INFO L175 Difference]: Start difference. First operand has 266 places, 266 transitions, 552 flow. Second operand 3 states and 774 transitions. [2024-10-11 17:02:16,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 596 flow [2024-10-11 17:02:16,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,853 INFO L231 Difference]: Finished difference. Result has 264 places, 265 transitions, 550 flow [2024-10-11 17:02:16,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=265} [2024-10-11 17:02:16,854 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -12 predicate places. [2024-10-11 17:02:16,854 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 265 transitions, 550 flow [2024-10-11 17:02:16,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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) [2024-10-11 17:02:16,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,855 INFO L204 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] [2024-10-11 17:02:16,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:02:16,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:16,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1864809506, now seen corresponding path program 1 times [2024-10-11 17:02:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43833185] [2024-10-11 17:02:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43833185] [2024-10-11 17:02:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43833185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922707631] [2024-10-11 17:02:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 290 [2024-10-11 17:02:16,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 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) [2024-10-11 17:02:16,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 290 [2024-10-11 17:02:16,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,631 INFO L124 PetriNetUnfolderBase]: 985/6371 cut-off events. [2024-10-11 17:02:17,631 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-10-11 17:02:17,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7670 conditions, 6371 events. 985/6371 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 69387 event pairs, 630 based on Foata normal form. 0/5359 useless extension candidates. Maximal degree in co-relation 7629. Up to 1120 conditions per place. [2024-10-11 17:02:17,677 INFO L140 encePairwiseOnDemand]: 280/290 looper letters, 27 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2024-10-11 17:02:17,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 256 transitions, 588 flow [2024-10-11 17:02:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-11 17:02:17,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8632183908045977 [2024-10-11 17:02:17,680 INFO L175 Difference]: Start difference. First operand has 264 places, 265 transitions, 550 flow. Second operand 3 states and 751 transitions. [2024-10-11 17:02:17,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 256 transitions, 588 flow [2024-10-11 17:02:17,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 256 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:17,685 INFO L231 Difference]: Finished difference. Result has 255 places, 256 transitions, 530 flow [2024-10-11 17:02:17,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=255, PETRI_TRANSITIONS=256} [2024-10-11 17:02:17,687 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -21 predicate places. [2024-10-11 17:02:17,687 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 256 transitions, 530 flow [2024-10-11 17:02:17,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 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) [2024-10-11 17:02:17,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,688 INFO L204 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] [2024-10-11 17:02:17,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:02:17,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:17,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2017621733, now seen corresponding path program 1 times [2024-10-11 17:02:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779733570] [2024-10-11 17:02:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779733570] [2024-10-11 17:02:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779733570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674150806] [2024-10-11 17:02:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 290 [2024-10-11 17:02:17,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 256 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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) [2024-10-11 17:02:17,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 290 [2024-10-11 17:02:17,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,912 INFO L124 PetriNetUnfolderBase]: 190/1771 cut-off events. [2024-10-11 17:02:17,912 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-10-11 17:02:17,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 1771 events. 190/1771 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13802 event pairs, 108 based on Foata normal form. 0/1490 useless extension candidates. Maximal degree in co-relation 1996. Up to 196 conditions per place. [2024-10-11 17:02:17,929 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 15 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-10-11 17:02:17,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 562 flow [2024-10-11 17:02:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2024-10-11 17:02:17,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.903448275862069 [2024-10-11 17:02:17,931 INFO L175 Difference]: Start difference. First operand has 255 places, 256 transitions, 530 flow. Second operand 3 states and 786 transitions. [2024-10-11 17:02:17,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 562 flow [2024-10-11 17:02:17,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 255 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:17,935 INFO L231 Difference]: Finished difference. Result has 255 places, 255 transitions, 531 flow [2024-10-11 17:02:17,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=255, PETRI_TRANSITIONS=255} [2024-10-11 17:02:17,936 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -21 predicate places. [2024-10-11 17:02:17,937 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 255 transitions, 531 flow [2024-10-11 17:02:17,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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) [2024-10-11 17:02:17,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,937 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:17,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:02:17,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -46969442, now seen corresponding path program 1 times [2024-10-11 17:02:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166697018] [2024-10-11 17:02:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166697018] [2024-10-11 17:02:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166697018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604418756] [2024-10-11 17:02:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:18,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 290 [2024-10-11 17:02:18,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 255 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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) [2024-10-11 17:02:18,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:18,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 290 [2024-10-11 17:02:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:20,775 INFO L124 PetriNetUnfolderBase]: 4660/23986 cut-off events. [2024-10-11 17:02:20,776 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-10-11 17:02:20,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30445 conditions, 23986 events. 4660/23986 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 330556 event pairs, 1667 based on Foata normal form. 0/20563 useless extension candidates. Maximal degree in co-relation 30404. Up to 4132 conditions per place. [2024-10-11 17:02:20,954 INFO L140 encePairwiseOnDemand]: 260/290 looper letters, 48 selfloop transitions, 21 changer transitions 0/284 dead transitions. [2024-10-11 17:02:20,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 284 transitions, 737 flow [2024-10-11 17:02:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2024-10-11 17:02:20,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9 [2024-10-11 17:02:20,956 INFO L175 Difference]: Start difference. First operand has 255 places, 255 transitions, 531 flow. Second operand 3 states and 783 transitions. [2024-10-11 17:02:20,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 284 transitions, 737 flow [2024-10-11 17:02:20,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 284 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:20,960 INFO L231 Difference]: Finished difference. Result has 257 places, 276 transitions, 713 flow [2024-10-11 17:02:20,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=257, PETRI_TRANSITIONS=276} [2024-10-11 17:02:20,961 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -19 predicate places. [2024-10-11 17:02:20,961 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 276 transitions, 713 flow [2024-10-11 17:02:20,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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) [2024-10-11 17:02:20,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:20,962 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:02:20,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1151193954, now seen corresponding path program 1 times [2024-10-11 17:02:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841734677] [2024-10-11 17:02:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 17:02:21,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:21,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841734677] [2024-10-11 17:02:21,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841734677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:21,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:21,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837980980] [2024-10-11 17:02:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:21,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:21,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:21,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 290 [2024-10-11 17:02:21,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 276 transitions, 713 flow. Second operand has 5 states, 5 states have (on average 254.6) internal successors, (1273), 5 states have internal predecessors, (1273), 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) [2024-10-11 17:02:21,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:21,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 290 [2024-10-11 17:02:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:21,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][86], [277#true, 132#L1045-2true, 291#true, 59#L1060-4true, Black: 293#(= |#race~next~0| 0), 47#$Ultimate##0true, 296#true, 275#true, 273#true, 203#L1045-2true, 287#(= |#race~len~0| 0)]) [2024-10-11 17:02:21,789 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-10-11 17:02:21,789 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 17:02:21,790 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 17:02:21,790 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-11 17:02:22,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][86], [277#true, 132#L1045-2true, 291#true, 59#L1060-4true, Black: 293#(= |#race~next~0| 0), 70#L1040-3true, 296#true, 275#true, 273#true, 203#L1045-2true, 287#(= |#race~len~0| 0)]) [2024-10-11 17:02:22,161 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-11 17:02:22,162 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-11 17:02:22,162 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-11 17:02:22,162 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:22,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([943] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][168], [277#true, 132#L1045-2true, 227#L1045-2true, 59#L1060-4true, Black: 291#true, 243#L1043-6true, 296#true, 275#true, 273#true, 293#(= |#race~next~0| 0), 287#(= |#race~len~0| 0)]) [2024-10-11 17:02:22,390 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-11 17:02:22,390 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:02:22,391 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-11 17:02:22,391 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-11 17:02:22,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1013] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][121], [277#true, 227#L1045-2true, 132#L1045-2true, 291#true, 59#L1060-4true, Black: 293#(= |#race~next~0| 0), 296#true, 275#true, 273#true, 203#L1045-2true, 287#(= |#race~len~0| 0)]) [2024-10-11 17:02:22,571 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-10-11 17:02:22,571 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-11 17:02:22,571 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-11 17:02:22,571 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-11 17:02:23,007 INFO L124 PetriNetUnfolderBase]: 2517/17390 cut-off events. [2024-10-11 17:02:23,007 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-10-11 17:02:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21912 conditions, 17390 events. 2517/17390 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 237451 event pairs, 1063 based on Foata normal form. 1/15068 useless extension candidates. Maximal degree in co-relation 21870. Up to 2203 conditions per place. [2024-10-11 17:02:23,156 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 20 selfloop transitions, 0 changer transitions 4/279 dead transitions. [2024-10-11 17:02:23,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 279 transitions, 767 flow [2024-10-11 17:02:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1285 transitions. [2024-10-11 17:02:23,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8862068965517241 [2024-10-11 17:02:23,160 INFO L175 Difference]: Start difference. First operand has 257 places, 276 transitions, 713 flow. Second operand 5 states and 1285 transitions. [2024-10-11 17:02:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 279 transitions, 767 flow [2024-10-11 17:02:23,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 279 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:23,183 INFO L231 Difference]: Finished difference. Result has 262 places, 275 transitions, 675 flow [2024-10-11 17:02:23,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=675, PETRI_PLACES=262, PETRI_TRANSITIONS=275} [2024-10-11 17:02:23,334 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -14 predicate places. [2024-10-11 17:02:23,334 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 275 transitions, 675 flow [2024-10-11 17:02:23,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 254.6) internal successors, (1273), 5 states have internal predecessors, (1273), 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) [2024-10-11 17:02:23,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:23,335 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:23,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:02:23,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-10-11 17:02:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 15122776, now seen corresponding path program 1 times [2024-10-11 17:02:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820689193] [2024-10-11 17:02:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:23,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:23,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:23,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:23,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2024-10-11 17:02:23,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2024-10-11 17:02:23,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2024-10-11 17:02:23,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2024-10-11 17:02:23,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2024-10-11 17:02:23,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2024-10-11 17:02:23,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2024-10-11 17:02:23,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2024-10-11 17:02:23,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:02:23,379 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:23,380 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:23,380 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 17:02:23,414 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:23,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 343 places, 361 transitions, 750 flow [2024-10-11 17:02:23,450 INFO L124 PetriNetUnfolderBase]: 31/407 cut-off events. [2024-10-11 17:02:23,450 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:02:23,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 407 events. 31/407 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1417 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 332. Up to 10 conditions per place. [2024-10-11 17:02:23,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 343 places, 361 transitions, 750 flow [2024-10-11 17:02:23,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 361 transitions, 750 flow [2024-10-11 17:02:23,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:23,458 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7770dab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:23,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-11 17:02:23,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:23,460 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:02:23,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:23,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:23,460 INFO L204 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] [2024-10-11 17:02:23,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2024-10-11 17:02:23,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1812622224, now seen corresponding path program 1 times [2024-10-11 17:02:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957493816] [2024-10-11 17:02:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957493816] [2024-10-11 17:02:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957493816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720394222] [2024-10-11 17:02:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:23,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 361 [2024-10-11 17:02:23,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 361 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 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) [2024-10-11 17:02:23,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:23,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 361 [2024-10-11 17:02:23,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:28,105 INFO L124 PetriNetUnfolderBase]: 8203/34879 cut-off events. [2024-10-11 17:02:28,105 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2024-10-11 17:02:28,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46428 conditions, 34879 events. 8203/34879 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 484723 event pairs, 6804 based on Foata normal form. 7100/36380 useless extension candidates. Maximal degree in co-relation 38090. Up to 9608 conditions per place. [2024-10-11 17:02:28,866 INFO L140 encePairwiseOnDemand]: 343/361 looper letters, 31 selfloop transitions, 2 changer transitions 1/333 dead transitions. [2024-10-11 17:02:28,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 333 transitions, 760 flow [2024-10-11 17:02:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2024-10-11 17:02:28,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956602031394275 [2024-10-11 17:02:28,874 INFO L175 Difference]: Start difference. First operand has 343 places, 361 transitions, 750 flow. Second operand 3 states and 970 transitions. [2024-10-11 17:02:28,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 333 transitions, 760 flow [2024-10-11 17:02:28,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 333 transitions, 754 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:28,879 INFO L231 Difference]: Finished difference. Result has 331 places, 332 transitions, 690 flow [2024-10-11 17:02:28,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=331, PETRI_TRANSITIONS=332} [2024-10-11 17:02:28,880 INFO L277 CegarLoopForPetriNet]: 343 programPoint places, -12 predicate places. [2024-10-11 17:02:28,880 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 332 transitions, 690 flow [2024-10-11 17:02:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 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) [2024-10-11 17:02:28,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:28,881 INFO L204 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] [2024-10-11 17:02:28,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:02:28,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2024-10-11 17:02:28,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1774332754, now seen corresponding path program 1 times [2024-10-11 17:02:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78554587] [2024-10-11 17:02:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78554587] [2024-10-11 17:02:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78554587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:28,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365836272] [2024-10-11 17:02:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:28,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:28,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 361 [2024-10-11 17:02:28,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 332 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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) [2024-10-11 17:02:28,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:28,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 361 [2024-10-11 17:02:28,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:30,808 INFO L124 PetriNetUnfolderBase]: 2303/13473 cut-off events. [2024-10-11 17:02:30,809 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2024-10-11 17:02:30,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16457 conditions, 13473 events. 2303/13473 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 168750 event pairs, 1720 based on Foata normal form. 0/11140 useless extension candidates. Maximal degree in co-relation 16423. Up to 2507 conditions per place. [2024-10-11 17:02:30,963 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 26 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2024-10-11 17:02:30,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 331 transitions, 744 flow [2024-10-11 17:02:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2024-10-11 17:02:30,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8910433979686058 [2024-10-11 17:02:30,966 INFO L175 Difference]: Start difference. First operand has 331 places, 332 transitions, 690 flow. Second operand 3 states and 965 transitions. [2024-10-11 17:02:30,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 331 transitions, 744 flow [2024-10-11 17:02:30,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 331 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:30,969 INFO L231 Difference]: Finished difference. Result has 329 places, 331 transitions, 688 flow [2024-10-11 17:02:30,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=329, PETRI_TRANSITIONS=331} [2024-10-11 17:02:30,970 INFO L277 CegarLoopForPetriNet]: 343 programPoint places, -14 predicate places. [2024-10-11 17:02:30,970 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 331 transitions, 688 flow [2024-10-11 17:02:30,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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) [2024-10-11 17:02:30,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:30,971 INFO L204 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] [2024-10-11 17:02:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:02:30,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2024-10-11 17:02:30,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash -421561534, now seen corresponding path program 1 times [2024-10-11 17:02:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:30,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462132852] [2024-10-11 17:02:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:30,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:30,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462132852] [2024-10-11 17:02:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462132852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:30,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:30,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:30,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48632976] [2024-10-11 17:02:30,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:30,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:31,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 361 [2024-10-11 17:02:31,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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) [2024-10-11 17:02:31,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:31,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 361 [2024-10-11 17:02:31,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:36,908 INFO L124 PetriNetUnfolderBase]: 9683/48118 cut-off events. [2024-10-11 17:02:36,909 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2024-10-11 17:02:37,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59883 conditions, 48118 events. 9683/48118 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 715129 event pairs, 6804 based on Foata normal form. 0/40526 useless extension candidates. Maximal degree in co-relation 59841. Up to 10556 conditions per place. [2024-10-11 17:02:37,646 INFO L140 encePairwiseOnDemand]: 349/361 looper letters, 34 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2024-10-11 17:02:37,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 320 transitions, 736 flow [2024-10-11 17:02:37,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2024-10-11 17:02:37,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8624192059095106 [2024-10-11 17:02:37,648 INFO L175 Difference]: Start difference. First operand has 329 places, 331 transitions, 688 flow. Second operand 3 states and 934 transitions. [2024-10-11 17:02:37,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 320 transitions, 736 flow [2024-10-11 17:02:37,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 320 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:37,653 INFO L231 Difference]: Finished difference. Result has 318 places, 320 transitions, 664 flow [2024-10-11 17:02:37,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=318, PETRI_TRANSITIONS=320} [2024-10-11 17:02:37,653 INFO L277 CegarLoopForPetriNet]: 343 programPoint places, -25 predicate places. [2024-10-11 17:02:37,654 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 320 transitions, 664 flow [2024-10-11 17:02:37,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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) [2024-10-11 17:02:37,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:37,655 INFO L204 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] [2024-10-11 17:02:37,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:02:37,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2024-10-11 17:02:37,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -121138885, now seen corresponding path program 1 times [2024-10-11 17:02:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:37,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453091882] [2024-10-11 17:02:37,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453091882] [2024-10-11 17:02:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453091882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637199219] [2024-10-11 17:02:37,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:37,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:37,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 361 [2024-10-11 17:02:37,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 320 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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) [2024-10-11 17:02:37,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:37,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 361 [2024-10-11 17:02:37,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:38,600 INFO L124 PetriNetUnfolderBase]: 1021/7289 cut-off events. [2024-10-11 17:02:38,600 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-10-11 17:02:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8580 conditions, 7289 events. 1021/7289 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 79945 event pairs, 684 based on Foata normal form. 0/6128 useless extension candidates. Maximal degree in co-relation 8538. Up to 1028 conditions per place. [2024-10-11 17:02:38,688 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 19 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2024-10-11 17:02:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 704 flow [2024-10-11 17:02:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2024-10-11 17:02:38,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9039704524469068 [2024-10-11 17:02:38,691 INFO L175 Difference]: Start difference. First operand has 318 places, 320 transitions, 664 flow. Second operand 3 states and 979 transitions. [2024-10-11 17:02:38,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 704 flow [2024-10-11 17:02:38,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:38,696 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 665 flow [2024-10-11 17:02:38,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2024-10-11 17:02:38,697 INFO L277 CegarLoopForPetriNet]: 343 programPoint places, -25 predicate places. [2024-10-11 17:02:38,697 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 665 flow [2024-10-11 17:02:38,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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) [2024-10-11 17:02:38,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:38,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:38,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:02:38,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2024-10-11 17:02:38,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -504263368, now seen corresponding path program 1 times [2024-10-11 17:02:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090500174] [2024-10-11 17:02:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:38,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090500174] [2024-10-11 17:02:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090500174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:38,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72037162] [2024-10-11 17:02:38,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:38,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 361 [2024-10-11 17:02:38,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 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) [2024-10-11 17:02:38,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:38,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 361 [2024-10-11 17:02:38,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand