./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.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.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 f04269da33313e0538e960083eba1e7b90d9e89847d2a89d06392d6991a3ed98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:02:10,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:02:10,523 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:10,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:02:10,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:02:10,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:02:10,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:02:10,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:02:10,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:02:10,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:02:10,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:02:10,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:02:10,568 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:02:10,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:02:10,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:02:10,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:02:10,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:02:10,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:02:10,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:02:10,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:02:10,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:02:10,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:02:10,576 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:02:10,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:02:10,576 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:02:10,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:02:10,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:02:10,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:02:10,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:02:10,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:02:10,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:02:10,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:10,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:02:10,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:02:10,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:02:10,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:02:10,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:02:10,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:02:10,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:02:10,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:02:10,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:02:10,584 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 -> f04269da33313e0538e960083eba1e7b90d9e89847d2a89d06392d6991a3ed98 [2024-10-11 17:02:10,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:02:10,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:02:10,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:02:10,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:02:10,879 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:02:10,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2024-10-11 17:02:12,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:02:12,693 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:02:12,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2024-10-11 17:02:12,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e4b5e1c7/85aacff52d3b41b898a0e0813b5e1536/FLAGb4b872207 [2024-10-11 17:02:12,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e4b5e1c7/85aacff52d3b41b898a0e0813b5e1536 [2024-10-11 17:02:12,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:02:12,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:02:12,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:12,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:02:12,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:02:12,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:12,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ce084d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:12, skipping insertion in model container [2024-10-11 17:02:12,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:12" (1/1) ... [2024-10-11 17:02:13,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:02:13,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:13,486 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:02:13,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:13,628 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:02:13,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:13 WrapperNode [2024-10-11 17:02:13,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:13,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:13,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:02:13,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:02:13,636 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:13" (1/1) ... [2024-10-11 17:02:13,654 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:13" (1/1) ... [2024-10-11 17:02:13,687 INFO L138 Inliner]: procedures = 274, calls = 20, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 145 [2024-10-11 17:02:13,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:13,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:02:13,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:02:13,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:02:13,697 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:13" (1/1) ... [2024-10-11 17:02:13,697 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:13" (1/1) ... [2024-10-11 17:02:13,701 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:13" (1/1) ... [2024-10-11 17:02:13,701 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:13" (1/1) ... [2024-10-11 17:02:13,707 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:13" (1/1) ... [2024-10-11 17:02:13,711 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:13" (1/1) ... [2024-10-11 17:02:13,713 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:13" (1/1) ... [2024-10-11 17:02:13,714 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:13" (1/1) ... [2024-10-11 17:02:13,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:02:13,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:02:13,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:02:13,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:02:13,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:13" (1/1) ... [2024-10-11 17:02:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:02:13,764 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:13,771 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:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:02:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-10-11 17:02:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-10-11 17:02:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:02:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:02:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:02:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:02:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:02:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:02:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:02:13,822 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:13,981 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:02:13,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:02:14,317 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:02:14,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:02:14,407 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:02:14,410 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:02:14,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:14 BoogieIcfgContainer [2024-10-11 17:02:14,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:02:14,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:02:14,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:02:14,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:02:14,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:12" (1/3) ... [2024-10-11 17:02:14,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a2efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:14, skipping insertion in model container [2024-10-11 17:02:14,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:13" (2/3) ... [2024-10-11 17:02:14,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a2efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:14, skipping insertion in model container [2024-10-11 17:02:14,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:14" (3/3) ... [2024-10-11 17:02:14,420 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12.i [2024-10-11 17:02:14,439 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:02:14,440 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-11 17:02:14,441 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:02:14,517 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 154 transitions, 312 flow [2024-10-11 17:02:14,630 INFO L124 PetriNetUnfolderBase]: 10/164 cut-off events. [2024-10-11 17:02:14,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:14,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 164 events. 10/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 166 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. [2024-10-11 17:02:14,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 154 transitions, 312 flow [2024-10-11 17:02:14,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 154 transitions, 312 flow [2024-10-11 17:02:14,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:14,657 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;@347f5541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:14,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-10-11 17:02:14,661 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:14,661 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-11 17:02:14,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:14,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:14,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:14,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:14,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash 139909539, now seen corresponding path program 1 times [2024-10-11 17:02:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014252484] [2024-10-11 17:02:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:14,903 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,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014252484] [2024-10-11 17:02:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014252484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:14,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:14,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466352829] [2024-10-11 17:02:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 154 [2024-10-11 17:02:15,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 154 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 154 [2024-10-11 17:02:15,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,111 INFO L124 PetriNetUnfolderBase]: 4/141 cut-off events. [2024-10-11 17:02:15,112 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:15,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 141 events. 4/141 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 12/133 useless extension candidates. Maximal degree in co-relation 79. Up to 11 conditions per place. [2024-10-11 17:02:15,115 INFO L140 encePairwiseOnDemand]: 141/154 looper letters, 10 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2024-10-11 17:02:15,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 302 flow [2024-10-11 17:02:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-10-11 17:02:15,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874458874458875 [2024-10-11 17:02:15,137 INFO L175 Difference]: Start difference. First operand has 148 places, 154 transitions, 312 flow. Second operand 3 states and 410 transitions. [2024-10-11 17:02:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 302 flow [2024-10-11 17:02:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 137 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:15,148 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 280 flow [2024-10-11 17:02:15,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2024-10-11 17:02:15,156 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -10 predicate places. [2024-10-11 17:02:15,157 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 280 flow [2024-10-11 17:02:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,157 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] [2024-10-11 17:02:15,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:02:15,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 866014814, now seen corresponding path program 1 times [2024-10-11 17:02:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682464014] [2024-10-11 17:02:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,221 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,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682464014] [2024-10-11 17:02:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682464014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272521624] [2024-10-11 17:02:15,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 154 [2024-10-11 17:02:15,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 154 [2024-10-11 17:02:15,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,285 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2024-10-11 17:02:15,286 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:15,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 139 events. 4/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 130. Up to 7 conditions per place. [2024-10-11 17:02:15,287 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 6 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-10-11 17:02:15,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 135 transitions, 294 flow [2024-10-11 17:02:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2024-10-11 17:02:15,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8831168831168831 [2024-10-11 17:02:15,294 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 280 flow. Second operand 3 states and 408 transitions. [2024-10-11 17:02:15,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 135 transitions, 294 flow [2024-10-11 17:02:15,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:15,302 INFO L231 Difference]: Finished difference. Result has 136 places, 135 transitions, 278 flow [2024-10-11 17:02:15,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, 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=278, PETRI_PLACES=136, PETRI_TRANSITIONS=135} [2024-10-11 17:02:15,303 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -12 predicate places. [2024-10-11 17:02:15,303 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 135 transitions, 278 flow [2024-10-11 17:02:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,304 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] [2024-10-11 17:02:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:02:15,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1598589562, now seen corresponding path program 1 times [2024-10-11 17:02:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074575187] [2024-10-11 17:02:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,389 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,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074575187] [2024-10-11 17:02:15,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074575187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106967735] [2024-10-11 17:02:15,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2024-10-11 17:02:15,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2024-10-11 17:02:15,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,491 INFO L124 PetriNetUnfolderBase]: 4/138 cut-off events. [2024-10-11 17:02:15,492 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:15,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 138 events. 4/138 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 129. Up to 12 conditions per place. [2024-10-11 17:02:15,493 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 11 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-10-11 17:02:15,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 134 transitions, 302 flow [2024-10-11 17:02:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2024-10-11 17:02:15,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614718614718615 [2024-10-11 17:02:15,496 INFO L175 Difference]: Start difference. First operand has 136 places, 135 transitions, 278 flow. Second operand 3 states and 398 transitions. [2024-10-11 17:02:15,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 134 transitions, 302 flow [2024-10-11 17:02:15,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:15,499 INFO L231 Difference]: Finished difference. Result has 135 places, 134 transitions, 276 flow [2024-10-11 17:02:15,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=135, PETRI_TRANSITIONS=134} [2024-10-11 17:02:15,500 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -13 predicate places. [2024-10-11 17:02:15,501 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 134 transitions, 276 flow [2024-10-11 17:02:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,502 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] [2024-10-11 17:02:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:02:15,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -436513338, now seen corresponding path program 1 times [2024-10-11 17:02:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554867520] [2024-10-11 17:02:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,553 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,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554867520] [2024-10-11 17:02:15,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554867520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782971637] [2024-10-11 17:02:15,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 154 [2024-10-11 17:02:15,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 154 [2024-10-11 17:02:15,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,615 INFO L124 PetriNetUnfolderBase]: 4/133 cut-off events. [2024-10-11 17:02:15,615 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:15,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 133 events. 4/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 117. Up to 13 conditions per place. [2024-10-11 17:02:15,616 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 13 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2024-10-11 17:02:15,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 294 flow [2024-10-11 17:02:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2024-10-11 17:02:15,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8463203463203464 [2024-10-11 17:02:15,619 INFO L175 Difference]: Start difference. First operand has 135 places, 134 transitions, 276 flow. Second operand 3 states and 391 transitions. [2024-10-11 17:02:15,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 294 flow [2024-10-11 17:02:15,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:15,624 INFO L231 Difference]: Finished difference. Result has 130 places, 129 transitions, 264 flow [2024-10-11 17:02:15,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=130, PETRI_TRANSITIONS=129} [2024-10-11 17:02:15,626 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -18 predicate places. [2024-10-11 17:02:15,627 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 264 flow [2024-10-11 17:02:15,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,628 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] [2024-10-11 17:02:15,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:02:15,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:15,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1743849323, now seen corresponding path program 1 times [2024-10-11 17:02:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88115703] [2024-10-11 17:02:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,718 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,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88115703] [2024-10-11 17:02:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88115703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000357826] [2024-10-11 17:02:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 154 [2024-10-11 17:02:15,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 154 [2024-10-11 17:02:15,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,775 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2024-10-11 17:02:15,775 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:15,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 132 events. 4/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 8 conditions per place. [2024-10-11 17:02:15,777 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 7 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-10-11 17:02:15,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 128 transitions, 280 flow [2024-10-11 17:02:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2024-10-11 17:02:15,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2024-10-11 17:02:15,779 INFO L175 Difference]: Start difference. First operand has 130 places, 129 transitions, 264 flow. Second operand 3 states and 406 transitions. [2024-10-11 17:02:15,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 128 transitions, 280 flow [2024-10-11 17:02:15,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:15,784 INFO L231 Difference]: Finished difference. Result has 130 places, 128 transitions, 265 flow [2024-10-11 17:02:15,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=130, PETRI_TRANSITIONS=128} [2024-10-11 17:02:15,787 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -18 predicate places. [2024-10-11 17:02:15,787 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 128 transitions, 265 flow [2024-10-11 17:02:15,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,789 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] [2024-10-11 17:02:15,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:02:15,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:15,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -697673074, now seen corresponding path program 1 times [2024-10-11 17:02:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938854192] [2024-10-11 17:02:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,966 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:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938854192] [2024-10-11 17:02:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938854192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399916286] [2024-10-11 17:02:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:16,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 154 [2024-10-11 17:02:16,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 128 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 154 [2024-10-11 17:02:16,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,130 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2024-10-11 17:02:16,130 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:16,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 135 events. 3/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 124. Up to 15 conditions per place. [2024-10-11 17:02:16,176 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 14 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2024-10-11 17:02:16,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 307 flow [2024-10-11 17:02:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2024-10-11 17:02:16,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2024-10-11 17:02:16,183 INFO L175 Difference]: Start difference. First operand has 130 places, 128 transitions, 265 flow. Second operand 5 states and 649 transitions. [2024-10-11 17:02:16,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 307 flow [2024-10-11 17:02:16,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,191 INFO L231 Difference]: Finished difference. Result has 135 places, 127 transitions, 265 flow [2024-10-11 17:02:16,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=135, PETRI_TRANSITIONS=127} [2024-10-11 17:02:16,196 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -13 predicate places. [2024-10-11 17:02:16,197 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 265 flow [2024-10-11 17:02:16,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,197 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] [2024-10-11 17:02:16,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:02:16,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-10-11 17:02:16,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -653157826, now seen corresponding path program 1 times [2024-10-11 17:02:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105587284] [2024-10-11 17:02:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:16,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:16,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:16,283 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:16,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2024-10-11 17:02:16,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2024-10-11 17:02:16,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2024-10-11 17:02:16,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2024-10-11 17:02:16,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2024-10-11 17:02:16,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2024-10-11 17:02:16,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2024-10-11 17:02:16,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2024-10-11 17:02:16,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2024-10-11 17:02:16,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2024-10-11 17:02:16,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2024-10-11 17:02:16,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2024-10-11 17:02:16,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2024-10-11 17:02:16,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2024-10-11 17:02:16,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2024-10-11 17:02:16,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2024-10-11 17:02:16,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:02:16,296 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,304 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:16,305 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:02:16,346 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:16,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 231 transitions, 472 flow [2024-10-11 17:02:16,385 INFO L124 PetriNetUnfolderBase]: 17/253 cut-off events. [2024-10-11 17:02:16,385 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:16,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 253 events. 17/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 551 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 165. Up to 6 conditions per place. [2024-10-11 17:02:16,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 231 transitions, 472 flow [2024-10-11 17:02:16,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 231 transitions, 472 flow [2024-10-11 17:02:16,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:16,400 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;@347f5541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:16,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 17:02:16,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:16,405 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-11 17:02:16,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:16,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,405 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 193393546, now seen corresponding path program 1 times [2024-10-11 17:02:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852218092] [2024-10-11 17:02:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,442 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,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852218092] [2024-10-11 17:02:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852218092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451857601] [2024-10-11 17:02:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 231 [2024-10-11 17:02:16,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 231 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 231 [2024-10-11 17:02:16,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,619 INFO L124 PetriNetUnfolderBase]: 70/684 cut-off events. [2024-10-11 17:02:16,619 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-11 17:02:16,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 684 events. 70/684 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3871 event pairs, 42 based on Foata normal form. 99/667 useless extension candidates. Maximal degree in co-relation 626. Up to 102 conditions per place. [2024-10-11 17:02:16,625 INFO L140 encePairwiseOnDemand]: 211/231 looper letters, 17 selfloop transitions, 2 changer transitions 1/205 dead transitions. [2024-10-11 17:02:16,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 205 transitions, 458 flow [2024-10-11 17:02:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-10-11 17:02:16,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8802308802308803 [2024-10-11 17:02:16,631 INFO L175 Difference]: Start difference. First operand has 221 places, 231 transitions, 472 flow. Second operand 3 states and 610 transitions. [2024-10-11 17:02:16,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 205 transitions, 458 flow [2024-10-11 17:02:16,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 205 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:16,635 INFO L231 Difference]: Finished difference. Result has 205 places, 204 transitions, 422 flow [2024-10-11 17:02:16,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=205, PETRI_TRANSITIONS=204} [2024-10-11 17:02:16,636 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -16 predicate places. [2024-10-11 17:02:16,638 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 204 transitions, 422 flow [2024-10-11 17:02:16,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,639 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] [2024-10-11 17:02:16,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:02:16,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:16,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -286716930, now seen corresponding path program 1 times [2024-10-11 17:02:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798687406] [2024-10-11 17:02:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,667 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,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798687406] [2024-10-11 17:02:16,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798687406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734638416] [2024-10-11 17:02:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 231 [2024-10-11 17:02:16,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 204 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 231 [2024-10-11 17:02:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,744 INFO L124 PetriNetUnfolderBase]: 22/402 cut-off events. [2024-10-11 17:02:16,745 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:02:16,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 402 events. 22/402 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1571 event pairs, 6 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 417. Up to 22 conditions per place. [2024-10-11 17:02:16,749 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 9 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-10-11 17:02:16,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 203 transitions, 442 flow [2024-10-11 17:02:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2024-10-11 17:02:16,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2024-10-11 17:02:16,751 INFO L175 Difference]: Start difference. First operand has 205 places, 204 transitions, 422 flow. Second operand 3 states and 609 transitions. [2024-10-11 17:02:16,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 203 transitions, 442 flow [2024-10-11 17:02:16,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,756 INFO L231 Difference]: Finished difference. Result has 203 places, 203 transitions, 420 flow [2024-10-11 17:02:16,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=203, PETRI_TRANSITIONS=203} [2024-10-11 17:02:16,757 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -18 predicate places. [2024-10-11 17:02:16,757 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 203 transitions, 420 flow [2024-10-11 17:02:16,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,758 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] [2024-10-11 17:02:16,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:02:16,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -222965203, now seen corresponding path program 1 times [2024-10-11 17:02:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115581422] [2024-10-11 17:02:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,790 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,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115581422] [2024-10-11 17:02:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115581422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114716537] [2024-10-11 17:02:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 231 [2024-10-11 17:02:16,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 203 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 231 [2024-10-11 17:02:16,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,949 INFO L124 PetriNetUnfolderBase]: 42/537 cut-off events. [2024-10-11 17:02:16,949 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-11 17:02:16,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 537 events. 42/537 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2574 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 588. Up to 57 conditions per place. [2024-10-11 17:02:16,955 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 16 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-10-11 17:02:16,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 454 flow [2024-10-11 17:02:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2024-10-11 17:02:16,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2024-10-11 17:02:16,958 INFO L175 Difference]: Start difference. First operand has 203 places, 203 transitions, 420 flow. Second operand 3 states and 595 transitions. [2024-10-11 17:02:16,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 454 flow [2024-10-11 17:02:16,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 202 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,963 INFO L231 Difference]: Finished difference. Result has 202 places, 202 transitions, 418 flow [2024-10-11 17:02:16,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=202, PETRI_TRANSITIONS=202} [2024-10-11 17:02:16,964 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -19 predicate places. [2024-10-11 17:02:16,964 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 202 transitions, 418 flow [2024-10-11 17:02:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,965 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] [2024-10-11 17:02:16,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:02:16,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:16,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 587827373, now seen corresponding path program 1 times [2024-10-11 17:02:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922510558] [2024-10-11 17:02:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,000 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,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922510558] [2024-10-11 17:02:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922510558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205664141] [2024-10-11 17:02:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 231 [2024-10-11 17:02:17,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 202 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 231 [2024-10-11 17:02:17,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,132 INFO L124 PetriNetUnfolderBase]: 82/822 cut-off events. [2024-10-11 17:02:17,132 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 17:02:17,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 822 events. 82/822 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4804 event pairs, 42 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 923. Up to 109 conditions per place. [2024-10-11 17:02:17,140 INFO L140 encePairwiseOnDemand]: 223/231 looper letters, 20 selfloop transitions, 1 changer transitions 0/195 dead transitions. [2024-10-11 17:02:17,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 195 transitions, 446 flow [2024-10-11 17:02:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2024-10-11 17:02:17,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.836940836940837 [2024-10-11 17:02:17,143 INFO L175 Difference]: Start difference. First operand has 202 places, 202 transitions, 418 flow. Second operand 3 states and 580 transitions. [2024-10-11 17:02:17,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 195 transitions, 446 flow [2024-10-11 17:02:17,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 195 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:17,148 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 402 flow [2024-10-11 17:02:17,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2024-10-11 17:02:17,149 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -26 predicate places. [2024-10-11 17:02:17,149 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 402 flow [2024-10-11 17:02:17,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,150 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] [2024-10-11 17:02:17,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:02:17,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -108309678, now seen corresponding path program 1 times [2024-10-11 17:02:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191840833] [2024-10-11 17:02:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,192 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,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191840833] [2024-10-11 17:02:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191840833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722408488] [2024-10-11 17:02:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 231 [2024-10-11 17:02:17,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 231 [2024-10-11 17:02:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,273 INFO L124 PetriNetUnfolderBase]: 31/452 cut-off events. [2024-10-11 17:02:17,273 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:02:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 452 events. 31/452 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1869 event pairs, 12 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 470. Up to 36 conditions per place. [2024-10-11 17:02:17,277 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 11 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-10-11 17:02:17,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 194 transitions, 426 flow [2024-10-11 17:02:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 605 transitions. [2024-10-11 17:02:17,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2024-10-11 17:02:17,280 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 402 flow. Second operand 3 states and 605 transitions. [2024-10-11 17:02:17,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 194 transitions, 426 flow [2024-10-11 17:02:17,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 194 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:17,283 INFO L231 Difference]: Finished difference. Result has 195 places, 194 transitions, 403 flow [2024-10-11 17:02:17,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=195, PETRI_TRANSITIONS=194} [2024-10-11 17:02:17,285 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -26 predicate places. [2024-10-11 17:02:17,285 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 194 transitions, 403 flow [2024-10-11 17:02:17,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,286 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,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:02:17,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash -967577272, now seen corresponding path program 1 times [2024-10-11 17:02:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043301221] [2024-10-11 17:02:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,348 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,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043301221] [2024-10-11 17:02:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043301221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370766571] [2024-10-11 17:02:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 231 [2024-10-11 17:02:17,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 194 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 231 [2024-10-11 17:02:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,628 INFO L124 PetriNetUnfolderBase]: 195/1632 cut-off events. [2024-10-11 17:02:17,628 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:02:17,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1632 events. 195/1632 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12823 event pairs, 57 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1923. Up to 204 conditions per place. [2024-10-11 17:02:17,642 INFO L140 encePairwiseOnDemand]: 211/231 looper letters, 32 selfloop transitions, 14 changer transitions 0/213 dead transitions. [2024-10-11 17:02:17,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 213 transitions, 538 flow [2024-10-11 17:02:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2024-10-11 17:02:17,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8759018759018758 [2024-10-11 17:02:17,645 INFO L175 Difference]: Start difference. First operand has 195 places, 194 transitions, 403 flow. Second operand 3 states and 607 transitions. [2024-10-11 17:02:17,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 213 transitions, 538 flow [2024-10-11 17:02:17,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 213 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:17,650 INFO L231 Difference]: Finished difference. Result has 197 places, 208 transitions, 523 flow [2024-10-11 17:02:17,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=197, PETRI_TRANSITIONS=208} [2024-10-11 17:02:17,651 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -24 predicate places. [2024-10-11 17:02:17,651 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 523 flow [2024-10-11 17:02:17,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,652 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] [2024-10-11 17:02:17,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:02:17,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:17,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1811408447, now seen corresponding path program 1 times [2024-10-11 17:02:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785321563] [2024-10-11 17:02:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,730 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:17,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785321563] [2024-10-11 17:02:17,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785321563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394637807] [2024-10-11 17:02:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:17,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 231 [2024-10-11 17:02:17,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 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,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 231 [2024-10-11 17:02:17,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,981 INFO L124 PetriNetUnfolderBase]: 130/1525 cut-off events. [2024-10-11 17:02:17,982 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-11 17:02:17,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1525 events. 130/1525 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 11800 event pairs, 41 based on Foata normal form. 1/1329 useless extension candidates. Maximal degree in co-relation 1758. Up to 120 conditions per place. [2024-10-11 17:02:17,994 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 17 selfloop transitions, 0 changer transitions 4/211 dead transitions. [2024-10-11 17:02:17,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 211 transitions, 571 flow [2024-10-11 17:02:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 982 transitions. [2024-10-11 17:02:17,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8502164502164502 [2024-10-11 17:02:17,997 INFO L175 Difference]: Start difference. First operand has 197 places, 208 transitions, 523 flow. Second operand 5 states and 982 transitions. [2024-10-11 17:02:17,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 211 transitions, 571 flow [2024-10-11 17:02:18,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 211 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:18,003 INFO L231 Difference]: Finished difference. Result has 202 places, 207 transitions, 499 flow [2024-10-11 17:02:18,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=202, PETRI_TRANSITIONS=207} [2024-10-11 17:02:18,004 INFO L277 CegarLoopForPetriNet]: 221 programPoint places, -19 predicate places. [2024-10-11 17:02:18,004 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 207 transitions, 499 flow [2024-10-11 17:02:18,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 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,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:18,005 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] [2024-10-11 17:02:18,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:02:18,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-11 17:02:18,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1779418408, now seen corresponding path program 1 times [2024-10-11 17:02:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:18,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711220702] [2024-10-11 17:02:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:18,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:18,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:18,042 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:18,042 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2024-10-11 17:02:18,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2024-10-11 17:02:18,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2024-10-11 17:02:18,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2024-10-11 17:02:18,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2024-10-11 17:02:18,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2024-10-11 17:02:18,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2024-10-11 17:02:18,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2024-10-11 17:02:18,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2024-10-11 17:02:18,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2024-10-11 17:02:18,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2024-10-11 17:02:18,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2024-10-11 17:02:18,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2024-10-11 17:02:18,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2024-10-11 17:02:18,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2024-10-11 17:02:18,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2024-10-11 17:02:18,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2024-10-11 17:02:18,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2024-10-11 17:02:18,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2024-10-11 17:02:18,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2024-10-11 17:02:18,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2024-10-11 17:02:18,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2024-10-11 17:02:18,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2024-10-11 17:02:18,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2024-10-11 17:02:18,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2024-10-11 17:02:18,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2024-10-11 17:02:18,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2024-10-11 17:02:18,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2024-10-11 17:02:18,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2024-10-11 17:02:18,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:02:18,049 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:18,050 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:18,050 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:02:18,099 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:18,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 308 transitions, 634 flow [2024-10-11 17:02:18,143 INFO L124 PetriNetUnfolderBase]: 24/342 cut-off events. [2024-10-11 17:02:18,143 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:02:18,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 342 events. 24/342 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1027 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 257. Up to 8 conditions per place. [2024-10-11 17:02:18,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 308 transitions, 634 flow [2024-10-11 17:02:18,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 308 transitions, 634 flow [2024-10-11 17:02:18,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:18,153 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;@347f5541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:18,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-10-11 17:02:18,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:18,155 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-11 17:02:18,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:18,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:18,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:18,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:18,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1166950210, now seen corresponding path program 1 times [2024-10-11 17:02:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28550825] [2024-10-11 17:02:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:18,177 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:18,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:18,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28550825] [2024-10-11 17:02:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28550825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:18,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:18,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193762674] [2024-10-11 17:02:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:18,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:18,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:18,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:18,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:18,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 308 [2024-10-11 17:02:18,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 308 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 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,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:18,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 308 [2024-10-11 17:02:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:19,084 INFO L124 PetriNetUnfolderBase]: 829/4762 cut-off events. [2024-10-11 17:02:19,085 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-10-11 17:02:19,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 4762 events. 829/4762 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 48890 event pairs, 630 based on Foata normal form. 847/4809 useless extension candidates. Maximal degree in co-relation 4923. Up to 1033 conditions per place. [2024-10-11 17:02:19,148 INFO L140 encePairwiseOnDemand]: 281/308 looper letters, 24 selfloop transitions, 2 changer transitions 1/273 dead transitions. [2024-10-11 17:02:19,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 273 transitions, 616 flow [2024-10-11 17:02:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-11 17:02:19,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8766233766233766 [2024-10-11 17:02:19,152 INFO L175 Difference]: Start difference. First operand has 294 places, 308 transitions, 634 flow. Second operand 3 states and 810 transitions. [2024-10-11 17:02:19,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 273 transitions, 616 flow [2024-10-11 17:02:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 273 transitions, 614 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:19,159 INFO L231 Difference]: Finished difference. Result has 272 places, 272 transitions, 564 flow [2024-10-11 17:02:19,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=272, PETRI_TRANSITIONS=272} [2024-10-11 17:02:19,161 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -22 predicate places. [2024-10-11 17:02:19,161 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 272 transitions, 564 flow [2024-10-11 17:02:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 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:19,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:19,162 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] [2024-10-11 17:02:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:02:19,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:19,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1039618942, now seen corresponding path program 1 times [2024-10-11 17:02:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140359485] [2024-10-11 17:02:19,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:19,191 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:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140359485] [2024-10-11 17:02:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140359485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065088015] [2024-10-11 17:02:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:19,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 308 [2024-10-11 17:02:19,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 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:19,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:19,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 308 [2024-10-11 17:02:19,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:19,460 INFO L124 PetriNetUnfolderBase]: 97/1244 cut-off events. [2024-10-11 17:02:19,460 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 17:02:19,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1244 events. 97/1244 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8805 event pairs, 42 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1349. Up to 85 conditions per place. [2024-10-11 17:02:19,472 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 12 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-10-11 17:02:19,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 271 transitions, 590 flow [2024-10-11 17:02:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-11 17:02:19,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8766233766233766 [2024-10-11 17:02:19,475 INFO L175 Difference]: Start difference. First operand has 272 places, 272 transitions, 564 flow. Second operand 3 states and 810 transitions. [2024-10-11 17:02:19,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 271 transitions, 590 flow [2024-10-11 17:02:19,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 271 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:19,482 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 562 flow [2024-10-11 17:02:19,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2024-10-11 17:02:19,483 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -24 predicate places. [2024-10-11 17:02:19,483 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 562 flow [2024-10-11 17:02:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 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:19,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:19,484 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] [2024-10-11 17:02:19,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:02:19,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1611200609, now seen corresponding path program 1 times [2024-10-11 17:02:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522823103] [2024-10-11 17:02:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:19,530 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:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522823103] [2024-10-11 17:02:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522823103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:19,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905112367] [2024-10-11 17:02:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:19,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:19,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:19,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 308 [2024-10-11 17:02:19,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 562 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:19,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:19,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 308 [2024-10-11 17:02:19,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:19,976 INFO L124 PetriNetUnfolderBase]: 335/2641 cut-off events. [2024-10-11 17:02:19,977 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-10-11 17:02:19,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3124 conditions, 2641 events. 335/2641 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 23556 event pairs, 220 based on Foata normal form. 0/2180 useless extension candidates. Maximal degree in co-relation 3092. Up to 382 conditions per place. [2024-10-11 17:02:20,002 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 21 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-10-11 17:02:20,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 270 transitions, 606 flow [2024-10-11 17:02:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-10-11 17:02:20,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2024-10-11 17:02:20,006 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 562 flow. Second operand 3 states and 792 transitions. [2024-10-11 17:02:20,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 270 transitions, 606 flow [2024-10-11 17:02:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 270 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:20,012 INFO L231 Difference]: Finished difference. Result has 269 places, 270 transitions, 560 flow [2024-10-11 17:02:20,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=269, PETRI_TRANSITIONS=270} [2024-10-11 17:02:20,014 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -25 predicate places. [2024-10-11 17:02:20,014 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 270 transitions, 560 flow [2024-10-11 17:02:20,015 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:20,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:20,015 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] [2024-10-11 17:02:20,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:02:20,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:20,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -909696543, now seen corresponding path program 1 times [2024-10-11 17:02:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163326697] [2024-10-11 17:02:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:20,038 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:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163326697] [2024-10-11 17:02:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163326697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243759516] [2024-10-11 17:02:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:20,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:20,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 308 [2024-10-11 17:02:20,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 270 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:20,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 308 [2024-10-11 17:02:20,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:20,995 INFO L124 PetriNetUnfolderBase]: 985/6446 cut-off events. [2024-10-11 17:02:20,996 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-10-11 17:02:21,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7745 conditions, 6446 events. 985/6446 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 69832 event pairs, 630 based on Foata normal form. 0/5424 useless extension candidates. Maximal degree in co-relation 7705. Up to 1120 conditions per place. [2024-10-11 17:02:21,083 INFO L140 encePairwiseOnDemand]: 298/308 looper letters, 27 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2024-10-11 17:02:21,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 261 transitions, 598 flow [2024-10-11 17:02:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-10-11 17:02:21,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8322510822510822 [2024-10-11 17:02:21,086 INFO L175 Difference]: Start difference. First operand has 269 places, 270 transitions, 560 flow. Second operand 3 states and 769 transitions. [2024-10-11 17:02:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 261 transitions, 598 flow [2024-10-11 17:02:21,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 261 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:21,095 INFO L231 Difference]: Finished difference. Result has 260 places, 261 transitions, 540 flow [2024-10-11 17:02:21,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=260, PETRI_TRANSITIONS=261} [2024-10-11 17:02:21,096 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -34 predicate places. [2024-10-11 17:02:21,096 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 261 transitions, 540 flow [2024-10-11 17:02:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:21,097 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] [2024-10-11 17:02:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:02:21,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 285456518, now seen corresponding path program 1 times [2024-10-11 17:02:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390306437] [2024-10-11 17:02:21,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:21,137 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:21,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390306437] [2024-10-11 17:02:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390306437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:21,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:21,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:21,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596543274] [2024-10-11 17:02:21,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:21,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:21,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:21,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:21,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 308 [2024-10-11 17:02:21,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 261 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:21,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 308 [2024-10-11 17:02:21,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:21,462 INFO L124 PetriNetUnfolderBase]: 190/1800 cut-off events. [2024-10-11 17:02:21,462 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-10-11 17:02:21,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 1800 events. 190/1800 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13909 event pairs, 108 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 2026. Up to 196 conditions per place. [2024-10-11 17:02:21,487 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 15 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-10-11 17:02:21,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 260 transitions, 572 flow [2024-10-11 17:02:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-11 17:02:21,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2024-10-11 17:02:21,490 INFO L175 Difference]: Start difference. First operand has 260 places, 261 transitions, 540 flow. Second operand 3 states and 804 transitions. [2024-10-11 17:02:21,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 260 transitions, 572 flow [2024-10-11 17:02:21,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 260 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:21,496 INFO L231 Difference]: Finished difference. Result has 260 places, 260 transitions, 541 flow [2024-10-11 17:02:21,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=260, PETRI_TRANSITIONS=260} [2024-10-11 17:02:21,497 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -34 predicate places. [2024-10-11 17:02:21,497 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 260 transitions, 541 flow [2024-10-11 17:02:21,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:21,498 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:21,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:02:21,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1362069908, now seen corresponding path program 1 times [2024-10-11 17:02:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:21,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744540825] [2024-10-11 17:02:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:21,546 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:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744540825] [2024-10-11 17:02:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744540825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:21,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153904052] [2024-10-11 17:02:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:21,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:21,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 308 [2024-10-11 17:02:21,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 260 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:21,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 308 [2024-10-11 17:02:21,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:24,262 INFO L124 PetriNetUnfolderBase]: 4600/23472 cut-off events. [2024-10-11 17:02:24,263 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-10-11 17:02:24,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29931 conditions, 23472 events. 4600/23472 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 321794 event pairs, 1667 based on Foata normal form. 0/20147 useless extension candidates. Maximal degree in co-relation 29891. Up to 4132 conditions per place. [2024-10-11 17:02:24,527 INFO L140 encePairwiseOnDemand]: 278/308 looper letters, 48 selfloop transitions, 21 changer transitions 0/289 dead transitions. [2024-10-11 17:02:24,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 289 transitions, 747 flow [2024-10-11 17:02:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-10-11 17:02:24,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8668831168831169 [2024-10-11 17:02:24,711 INFO L175 Difference]: Start difference. First operand has 260 places, 260 transitions, 541 flow. Second operand 3 states and 801 transitions. [2024-10-11 17:02:24,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 289 transitions, 747 flow [2024-10-11 17:02:24,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 289 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:24,725 INFO L231 Difference]: Finished difference. Result has 262 places, 281 transitions, 723 flow [2024-10-11 17:02:24,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=262, PETRI_TRANSITIONS=281} [2024-10-11 17:02:24,726 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -32 predicate places. [2024-10-11 17:02:24,726 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 281 transitions, 723 flow [2024-10-11 17:02:24,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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:24,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:24,731 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] [2024-10-11 17:02:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:02:24,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 859366760, now seen corresponding path program 1 times [2024-10-11 17:02:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850275210] [2024-10-11 17:02:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:24,822 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:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850275210] [2024-10-11 17:02:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850275210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10688247] [2024-10-11 17:02:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:24,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:24,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 308 [2024-10-11 17:02:24,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 281 transitions, 723 flow. Second operand has 5 states, 5 states have (on average 260.6) internal successors, (1303), 5 states have internal predecessors, (1303), 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:24,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:24,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 308 [2024-10-11 17:02:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:25,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread1of3ForFork0_release_#t~nondet4#1=|v_thrThread1of3ForFork0_release_#t~nondet4#1_5|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread1of3ForFork0_release_#t~nondet4#1, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1][93], [308#(= |#race~len~0| 0), 42#L1046-4true, 317#true, 291#true, 312#true, 276#L1019true, Black: 314#(= |#race~next~0| 0), 52#$Ultimate##0true, 295#true, 293#true, 232#L1019true]) [2024-10-11 17:02:25,626 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-11 17:02:25,626 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-11 17:02:25,626 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-11 17:02:25,626 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-11 17:02:26,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread1of3ForFork0_release_#t~nondet4#1=|v_thrThread1of3ForFork0_release_#t~nondet4#1_5|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread1of3ForFork0_release_#t~nondet4#1, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1][93], [308#(= |#race~len~0| 0), 42#L1046-4true, 317#true, 291#true, 312#true, 276#L1019true, Black: 314#(= |#race~next~0| 0), 295#true, 293#true, 163#L1013true, 232#L1019true]) [2024-10-11 17:02:26,040 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-11 17:02:26,040 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:02:26,040 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:02:26,040 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-11 17:02:26,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1062] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of3ForFork0_release_#t~nondet4#1=|v_thrThread3of3ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread3of3ForFork0_assume_abort_if_not_~cond#1, thrThread3of3ForFork0_release_#t~nondet4#1, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1][175], [308#(= |#race~len~0| 0), 42#L1046-4true, 317#true, 291#true, 231#L1019true, 314#(= |#race~next~0| 0), 276#L1019true, Black: 312#true, 155#L1028-6true, 295#true, 293#true]) [2024-10-11 17:02:26,435 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-11 17:02:26,435 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-11 17:02:26,435 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-11 17:02:26,435 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-11 17:02:26,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of3ForFork0_release_#t~nondet4#1=|v_thrThread2of3ForFork0_release_#t~nondet4#1_5|, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of3ForFork0_release_#t~nondet4#1, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1][129], [308#(= |#race~len~0| 0), 42#L1046-4true, 317#true, 231#L1019true, 291#true, 312#true, 276#L1019true, Black: 314#(= |#race~next~0| 0), 295#true, 293#true, 232#L1019true]) [2024-10-11 17:02:26,461 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-11 17:02:26,461 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-11 17:02:26,461 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-11 17:02:26,461 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-11 17:02:26,881 INFO L124 PetriNetUnfolderBase]: 2516/17795 cut-off events. [2024-10-11 17:02:26,881 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-10-11 17:02:26,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22316 conditions, 17795 events. 2516/17795 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 243523 event pairs, 1056 based on Foata normal form. 1/15469 useless extension candidates. Maximal degree in co-relation 22275. Up to 2203 conditions per place. [2024-10-11 17:02:27,042 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 20 selfloop transitions, 0 changer transitions 4/284 dead transitions. [2024-10-11 17:02:27,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 284 transitions, 777 flow [2024-10-11 17:02:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1315 transitions. [2024-10-11 17:02:27,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8538961038961039 [2024-10-11 17:02:27,046 INFO L175 Difference]: Start difference. First operand has 262 places, 281 transitions, 723 flow. Second operand 5 states and 1315 transitions. [2024-10-11 17:02:27,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 284 transitions, 777 flow [2024-10-11 17:02:27,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 284 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:27,067 INFO L231 Difference]: Finished difference. Result has 267 places, 280 transitions, 685 flow [2024-10-11 17:02:27,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=685, PETRI_PLACES=267, PETRI_TRANSITIONS=280} [2024-10-11 17:02:27,069 INFO L277 CegarLoopForPetriNet]: 294 programPoint places, -27 predicate places. [2024-10-11 17:02:27,069 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 280 transitions, 685 flow [2024-10-11 17:02:27,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 260.6) internal successors, (1303), 5 states have internal predecessors, (1303), 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:27,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:27,070 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] [2024-10-11 17:02:27,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:02:27,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-11 17:02:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash -739137987, now seen corresponding path program 1 times [2024-10-11 17:02:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772731733] [2024-10-11 17:02:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:27,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:27,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:27,116 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:27,116 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2024-10-11 17:02:27,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2024-10-11 17:02:27,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2024-10-11 17:02:27,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2024-10-11 17:02:27,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2024-10-11 17:02:27,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2024-10-11 17:02:27,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2024-10-11 17:02:27,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2024-10-11 17:02:27,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2024-10-11 17:02:27,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2024-10-11 17:02:27,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2024-10-11 17:02:27,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2024-10-11 17:02:27,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2024-10-11 17:02:27,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:02:27,123 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:27,124 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:27,124 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 17:02:27,171 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:27,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 385 transitions, 798 flow [2024-10-11 17:02:27,232 INFO L124 PetriNetUnfolderBase]: 31/431 cut-off events. [2024-10-11 17:02:27,233 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:02:27,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 431 events. 31/431 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1537 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 350. Up to 10 conditions per place. [2024-10-11 17:02:27,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 385 transitions, 798 flow [2024-10-11 17:02:27,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 367 places, 385 transitions, 798 flow [2024-10-11 17:02:27,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:27,246 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;@347f5541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:27,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-10-11 17:02:27,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:27,247 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-11 17:02:27,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:27,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:27,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:27,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-11 17:02:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 353845567, now seen corresponding path program 1 times [2024-10-11 17:02:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501185558] [2024-10-11 17:02:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:27,262 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:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:27,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501185558] [2024-10-11 17:02:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501185558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161934044] [2024-10-11 17:02:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:27,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 385 [2024-10-11 17:02:27,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 385 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:27,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:27,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 385 [2024-10-11 17:02:27,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:32,243 INFO L124 PetriNetUnfolderBase]: 8203/35349 cut-off events. [2024-10-11 17:02:32,243 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2024-10-11 17:02:32,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46898 conditions, 35349 events. 8203/35349 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 493179 event pairs, 6804 based on Foata normal form. 7100/36849 useless extension candidates. Maximal degree in co-relation 38494. Up to 9608 conditions per place. [2024-10-11 17:02:32,775 INFO L140 encePairwiseOnDemand]: 351/385 looper letters, 31 selfloop transitions, 2 changer transitions 1/341 dead transitions. [2024-10-11 17:02:32,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 341 transitions, 776 flow [2024-10-11 17:02:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2024-10-11 17:02:32,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8744588744588745 [2024-10-11 17:02:32,778 INFO L175 Difference]: Start difference. First operand has 367 places, 385 transitions, 798 flow. Second operand 3 states and 1010 transitions. [2024-10-11 17:02:32,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 341 transitions, 776 flow [2024-10-11 17:02:32,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 770 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:32,785 INFO L231 Difference]: Finished difference. Result has 339 places, 340 transitions, 706 flow [2024-10-11 17:02:32,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=339, PETRI_TRANSITIONS=340} [2024-10-11 17:02:32,788 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -28 predicate places. [2024-10-11 17:02:32,788 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 340 transitions, 706 flow [2024-10-11 17:02:32,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:32,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:32,789 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] [2024-10-11 17:02:32,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:02:32,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-11 17:02:32,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:32,789 INFO L85 PathProgramCache]: Analyzing trace with hash 550055134, now seen corresponding path program 1 times [2024-10-11 17:02:32,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:32,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308746586] [2024-10-11 17:02:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:32,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:32,809 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:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308746586] [2024-10-11 17:02:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308746586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498393965] [2024-10-11 17:02:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:32,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:32,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 385 [2024-10-11 17:02:32,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 340 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:32,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:32,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 385 [2024-10-11 17:02:32,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:33,414 INFO L124 PetriNetUnfolderBase]: 379/3859 cut-off events. [2024-10-11 17:02:33,415 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-10-11 17:02:33,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 3859 events. 379/3859 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 38215 event pairs, 204 based on Foata normal form. 0/3136 useless extension candidates. Maximal degree in co-relation 4288. Up to 328 conditions per place. [2024-10-11 17:02:33,450 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 15 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2024-10-11 17:02:33,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 339 transitions, 738 flow [2024-10-11 17:02:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-10-11 17:02:33,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8753246753246753 [2024-10-11 17:02:33,453 INFO L175 Difference]: Start difference. First operand has 339 places, 340 transitions, 706 flow. Second operand 3 states and 1011 transitions. [2024-10-11 17:02:33,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 339 transitions, 738 flow [2024-10-11 17:02:33,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 339 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:33,459 INFO L231 Difference]: Finished difference. Result has 337 places, 339 transitions, 704 flow [2024-10-11 17:02:33,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=337, PETRI_TRANSITIONS=339} [2024-10-11 17:02:33,460 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -30 predicate places. [2024-10-11 17:02:33,460 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 339 transitions, 704 flow [2024-10-11 17:02:33,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:33,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:33,461 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] [2024-10-11 17:02:33,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:02:33,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-11 17:02:33,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash -391059422, now seen corresponding path program 1 times [2024-10-11 17:02:33,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:33,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249874530] [2024-10-11 17:02:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:33,482 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:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249874530] [2024-10-11 17:02:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249874530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:33,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:33,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681063280] [2024-10-11 17:02:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:33,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:33,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 385 [2024-10-11 17:02:33,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 339 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 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:33,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:33,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 385 [2024-10-11 17:02:33,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:35,520 INFO L124 PetriNetUnfolderBase]: 2303/13670 cut-off events. [2024-10-11 17:02:35,520 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2024-10-11 17:02:35,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16654 conditions, 13670 events. 2303/13670 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 169780 event pairs, 1720 based on Foata normal form. 0/11337 useless extension candidates. Maximal degree in co-relation 16621. Up to 2507 conditions per place. [2024-10-11 17:02:35,650 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 26 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2024-10-11 17:02:35,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 338 transitions, 758 flow [2024-10-11 17:02:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2024-10-11 17:02:35,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8562770562770563 [2024-10-11 17:02:35,653 INFO L175 Difference]: Start difference. First operand has 337 places, 339 transitions, 704 flow. Second operand 3 states and 989 transitions. [2024-10-11 17:02:35,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 338 transitions, 758 flow [2024-10-11 17:02:35,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 338 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:35,658 INFO L231 Difference]: Finished difference. Result has 336 places, 338 transitions, 702 flow [2024-10-11 17:02:35,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=336, PETRI_TRANSITIONS=338} [2024-10-11 17:02:35,659 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -31 predicate places. [2024-10-11 17:02:35,660 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 338 transitions, 702 flow [2024-10-11 17:02:35,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 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:35,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:35,660 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] [2024-10-11 17:02:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:02:35,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-11 17:02:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -634117790, now seen corresponding path program 1 times [2024-10-11 17:02:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860093502] [2024-10-11 17:02:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:35,682 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:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860093502] [2024-10-11 17:02:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860093502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:35,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:35,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903057873] [2024-10-11 17:02:35,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:35,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 385 [2024-10-11 17:02:35,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 338 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 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:35,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:35,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 385 [2024-10-11 17:02:35,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:42,269 INFO L124 PetriNetUnfolderBase]: 9761/49721 cut-off events. [2024-10-11 17:02:42,270 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2024-10-11 17:02:42,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61528 conditions, 49721 events. 9761/49721 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 741484 event pairs, 6804 based on Foata normal form. 0/41842 useless extension candidates. Maximal degree in co-relation 61487. Up to 10598 conditions per place. [2024-10-11 17:02:43,044 INFO L140 encePairwiseOnDemand]: 373/385 looper letters, 34 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2024-10-11 17:02:43,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 327 transitions, 750 flow [2024-10-11 17:02:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2024-10-11 17:02:43,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8294372294372294 [2024-10-11 17:02:43,047 INFO L175 Difference]: Start difference. First operand has 336 places, 338 transitions, 702 flow. Second operand 3 states and 958 transitions. [2024-10-11 17:02:43,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 327 transitions, 750 flow [2024-10-11 17:02:43,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 327 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:43,053 INFO L231 Difference]: Finished difference. Result has 325 places, 327 transitions, 678 flow [2024-10-11 17:02:43,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=325, PETRI_TRANSITIONS=327} [2024-10-11 17:02:43,054 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -42 predicate places. [2024-10-11 17:02:43,054 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 327 transitions, 678 flow [2024-10-11 17:02:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 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:43,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:43,055 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] [2024-10-11 17:02:43,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:02:43,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-11 17:02:43,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1369819385, now seen corresponding path program 1 times [2024-10-11 17:02:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266279380] [2024-10-11 17:02:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:43,081 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:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:43,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266279380] [2024-10-11 17:02:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266279380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529559655] [2024-10-11 17:02:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:43,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:43,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:43,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 385 [2024-10-11 17:02:43,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 327 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:43,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:43,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 385 [2024-10-11 17:02:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:44,272 INFO L124 PetriNetUnfolderBase]: 1021/7404 cut-off events. [2024-10-11 17:02:44,272 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-10-11 17:02:44,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 7404 events. 1021/7404 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 80471 event pairs, 684 based on Foata normal form. 0/6219 useless extension candidates. Maximal degree in co-relation 8654. Up to 1028 conditions per place. [2024-10-11 17:02:44,377 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 19 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2024-10-11 17:02:44,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 326 transitions, 718 flow [2024-10-11 17:02:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1003 transitions. [2024-10-11 17:02:44,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8683982683982684 [2024-10-11 17:02:44,380 INFO L175 Difference]: Start difference. First operand has 325 places, 327 transitions, 678 flow. Second operand 3 states and 1003 transitions. [2024-10-11 17:02:44,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 326 transitions, 718 flow [2024-10-11 17:02:44,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 326 transitions, 717 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:44,387 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 679 flow [2024-10-11 17:02:44,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2024-10-11 17:02:44,388 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -42 predicate places. [2024-10-11 17:02:44,388 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 679 flow [2024-10-11 17:02:44,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:44,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:44,389 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:44,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:02:44,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-11 17:02:44,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1275965696, now seen corresponding path program 1 times [2024-10-11 17:02:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918065986] [2024-10-11 17:02:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:44,425 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:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918065986] [2024-10-11 17:02:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918065986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089347469] [2024-10-11 17:02:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:44,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 385 [2024-10-11 17:02:44,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 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:44,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:44,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 385 [2024-10-11 17:02:44,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand