/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:17:09,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:17:09,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:17:09,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:17:09,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:17:09,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:17:09,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:17:09,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:17:09,680 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:17:09,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:17:09,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:17:09,683 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:17:09,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:17:09,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:17:09,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:17:09,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:17:09,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:17:09,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:17:09,685 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:17:09,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:17:09,685 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:17:09,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:17:09,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:17:09,686 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:17:09,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:17:09,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:17:09,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:17:09,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:17:09,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:17:09,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:17:09,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:17:09,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:17:09,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:17:09,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:17:09,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:17:09,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:17:09,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:17:09,871 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:17:09,871 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:17:09,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2023-11-30 03:17:10,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:17:11,001 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:17:11,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2023-11-30 03:17:11,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc321817/7609cab3f6c44291aaddf0327251bec2/FLAG3b4da5ae8 [2023-11-30 03:17:11,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc321817/7609cab3f6c44291aaddf0327251bec2 [2023-11-30 03:17:11,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:17:11,019 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:17:11,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:17:11,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:17:11,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:17:11,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c1796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11, skipping insertion in model container [2023-11-30 03:17:11,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,055 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:17:11,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:17:11,200 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:17:11,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:17:11,262 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:17:11,262 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:17:11,267 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:17:11,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11 WrapperNode [2023-11-30 03:17:11,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:17:11,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:17:11,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:17:11,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:17:11,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,326 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 1033 [2023-11-30 03:17:11,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:17:11,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:17:11,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:17:11,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:17:11,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:17:11,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:17:11,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:17:11,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:17:11,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (1/1) ... [2023-11-30 03:17:11,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:17:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:17:11,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:17:11,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:17:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:17:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:17:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:17:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:17:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:17:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:17:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:17:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:17:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:17:11,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:17:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:17:11,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:17:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:17:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:17:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:17:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:17:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:17:11,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:17:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:17:11,489 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:17:11,634 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:17:11,636 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:17:12,493 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:17:13,534 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:17:13,534 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-30 03:17:13,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:17:13 BoogieIcfgContainer [2023-11-30 03:17:13,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:17:13,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:17:13,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:17:13,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:17:13,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:17:11" (1/3) ... [2023-11-30 03:17:13,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8675ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:17:13, skipping insertion in model container [2023-11-30 03:17:13,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:11" (2/3) ... [2023-11-30 03:17:13,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8675ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:17:13, skipping insertion in model container [2023-11-30 03:17:13,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:17:13" (3/3) ... [2023-11-30 03:17:13,541 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2023-11-30 03:17:13,553 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:17:13,554 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 168 error locations. [2023-11-30 03:17:13,554 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:17:13,679 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:17:13,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 650 places, 662 transitions, 1352 flow [2023-11-30 03:17:13,828 INFO L124 PetriNetUnfolderBase]: 25/658 cut-off events. [2023-11-30 03:17:13,828 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:17:13,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 658 events. 25/658 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1106 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 565. Up to 2 conditions per place. [2023-11-30 03:17:13,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 650 places, 662 transitions, 1352 flow [2023-11-30 03:17:13,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 622 places, 633 transitions, 1290 flow [2023-11-30 03:17:13,852 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:17:13,856 INFO L362 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, mHoare=true, 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;@6e15a0f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:17:13,857 INFO L363 AbstractCegarLoop]: Starting to check reachability of 304 error locations. [2023-11-30 03:17:13,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:17:13,860 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2023-11-30 03:17:13,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:17:13,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:13,861 INFO L232 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] [2023-11-30 03:17:13,861 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:13,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash -527386000, now seen corresponding path program 1 times [2023-11-30 03:17:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767056506] [2023-11-30 03:17:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767056506] [2023-11-30 03:17:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767056506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485895601] [2023-11-30 03:17:14,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:14,012 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:14,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:14,034 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:17:14,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 633 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:14,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:14,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:17:14,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:14,951 INFO L124 PetriNetUnfolderBase]: 942/2992 cut-off events. [2023-11-30 03:17:14,951 INFO L125 PetriNetUnfolderBase]: For 334/344 co-relation queries the response was YES. [2023-11-30 03:17:14,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 2992 events. 942/2992 cut-off events. For 334/344 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21379 event pairs, 586 based on Foata normal form. 626/3331 useless extension candidates. Maximal degree in co-relation 3903. Up to 1260 conditions per place. [2023-11-30 03:17:14,973 INFO L140 encePairwiseOnDemand]: 511/662 looper letters, 25 selfloop transitions, 2 changer transitions 8/484 dead transitions. [2023-11-30 03:17:14,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 484 transitions, 1046 flow [2023-11-30 03:17:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1622 transitions. [2023-11-30 03:17:14,985 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8167170191339376 [2023-11-30 03:17:14,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1622 transitions. [2023-11-30 03:17:14,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1622 transitions. [2023-11-30 03:17:14,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:14,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1622 transitions. [2023-11-30 03:17:14,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 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) [2023-11-30 03:17:15,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:15,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:15,003 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -131 predicate places. [2023-11-30 03:17:15,004 INFO L500 AbstractCegarLoop]: Abstraction has has 491 places, 484 transitions, 1046 flow [2023-11-30 03:17:15,004 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:15,005 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:15,005 INFO L232 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] [2023-11-30 03:17:15,005 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:17:15,005 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:15,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash -457599684, now seen corresponding path program 1 times [2023-11-30 03:17:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:15,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043129871] [2023-11-30 03:17:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:15,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:15,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043129871] [2023-11-30 03:17:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043129871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:15,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:15,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99012543] [2023-11-30 03:17:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:15,053 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:15,055 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:17:15,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 484 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:15,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:15,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:17:15,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:15,802 INFO L124 PetriNetUnfolderBase]: 942/2991 cut-off events. [2023-11-30 03:17:15,802 INFO L125 PetriNetUnfolderBase]: For 658/922 co-relation queries the response was YES. [2023-11-30 03:17:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 2991 events. 942/2991 cut-off events. For 658/922 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21398 event pairs, 586 based on Foata normal form. 0/2705 useless extension candidates. Maximal degree in co-relation 5097. Up to 1261 conditions per place. [2023-11-30 03:17:15,823 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 26 selfloop transitions, 2 changer transitions 8/483 dead transitions. [2023-11-30 03:17:15,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 483 transitions, 1100 flow [2023-11-30 03:17:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:17:15,826 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:17:15,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:17:15,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:17:15,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:15,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:17:15,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:17:15,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:15,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:15,833 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -130 predicate places. [2023-11-30 03:17:15,833 INFO L500 AbstractCegarLoop]: Abstraction has has 492 places, 483 transitions, 1100 flow [2023-11-30 03:17:15,834 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:15,834 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:15,834 INFO L232 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] [2023-11-30 03:17:15,834 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:17:15,835 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:15,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash -415980754, now seen corresponding path program 1 times [2023-11-30 03:17:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242689476] [2023-11-30 03:17:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242689476] [2023-11-30 03:17:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242689476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:15,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:15,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652742971] [2023-11-30 03:17:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:15,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:15,879 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:17:15,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 483 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:15,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:15,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:17:15,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:16,533 INFO L124 PetriNetUnfolderBase]: 942/2990 cut-off events. [2023-11-30 03:17:16,533 INFO L125 PetriNetUnfolderBase]: For 1247/1765 co-relation queries the response was YES. [2023-11-30 03:17:16,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7040 conditions, 2990 events. 942/2990 cut-off events. For 1247/1765 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21392 event pairs, 586 based on Foata normal form. 0/2705 useless extension candidates. Maximal degree in co-relation 6291. Up to 1261 conditions per place. [2023-11-30 03:17:16,559 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 26 selfloop transitions, 2 changer transitions 8/482 dead transitions. [2023-11-30 03:17:16,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 482 transitions, 1154 flow [2023-11-30 03:17:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:17:16,562 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:17:16,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:17:16,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:17:16,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:16,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:17:16,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:17:16,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:16,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:16,570 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -129 predicate places. [2023-11-30 03:17:16,570 INFO L500 AbstractCegarLoop]: Abstraction has has 493 places, 482 transitions, 1154 flow [2023-11-30 03:17:16,571 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:16,571 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:16,571 INFO L232 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] [2023-11-30 03:17:16,572 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:17:16,572 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:16,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash 780927437, now seen corresponding path program 1 times [2023-11-30 03:17:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383720465] [2023-11-30 03:17:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383720465] [2023-11-30 03:17:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383720465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:16,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:16,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015968563] [2023-11-30 03:17:16,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:16,622 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:16,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:16,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:16,624 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:17:16,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 482 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:16,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:16,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:17:16,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:17,425 INFO L124 PetriNetUnfolderBase]: 1031/2808 cut-off events. [2023-11-30 03:17:17,426 INFO L125 PetriNetUnfolderBase]: For 2087/2698 co-relation queries the response was YES. [2023-11-30 03:17:17,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8666 conditions, 2808 events. 1031/2808 cut-off events. For 2087/2698 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16617 event pairs, 122 based on Foata normal form. 1/2605 useless extension candidates. Maximal degree in co-relation 7577. Up to 1392 conditions per place. [2023-11-30 03:17:17,451 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 36 selfloop transitions, 2 changer transitions 8/495 dead transitions. [2023-11-30 03:17:17,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 495 transitions, 1359 flow [2023-11-30 03:17:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1497 transitions. [2023-11-30 03:17:17,454 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7537764350453172 [2023-11-30 03:17:17,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1497 transitions. [2023-11-30 03:17:17,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1497 transitions. [2023-11-30 03:17:17,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:17,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1497 transitions. [2023-11-30 03:17:17,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 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) [2023-11-30 03:17:17,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:17,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:17,461 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -128 predicate places. [2023-11-30 03:17:17,461 INFO L500 AbstractCegarLoop]: Abstraction has has 494 places, 495 transitions, 1359 flow [2023-11-30 03:17:17,461 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:17,462 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:17,462 INFO L232 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] [2023-11-30 03:17:17,462 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:17:17,462 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:17,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash 671104961, now seen corresponding path program 1 times [2023-11-30 03:17:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:17,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940479424] [2023-11-30 03:17:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940479424] [2023-11-30 03:17:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940479424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:17,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:17,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862930498] [2023-11-30 03:17:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:17,493 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:17,495 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:17:17,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 495 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:17,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:17,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:17:17,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:18,120 INFO L124 PetriNetUnfolderBase]: 1031/2807 cut-off events. [2023-11-30 03:17:18,120 INFO L125 PetriNetUnfolderBase]: For 3045/3856 co-relation queries the response was YES. [2023-11-30 03:17:18,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10055 conditions, 2807 events. 1031/2807 cut-off events. For 3045/3856 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16537 event pairs, 122 based on Foata normal form. 1/2605 useless extension candidates. Maximal degree in co-relation 8864. Up to 1392 conditions per place. [2023-11-30 03:17:18,150 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 37 selfloop transitions, 2 changer transitions 8/494 dead transitions. [2023-11-30 03:17:18,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 494 transitions, 1435 flow [2023-11-30 03:17:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:17:18,152 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:17:18,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:17:18,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:17:18,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:18,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:17:18,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:17:18,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:18,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:18,159 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -127 predicate places. [2023-11-30 03:17:18,159 INFO L500 AbstractCegarLoop]: Abstraction has has 495 places, 494 transitions, 1435 flow [2023-11-30 03:17:18,160 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:18,160 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:18,160 INFO L232 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] [2023-11-30 03:17:18,160 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:17:18,160 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:18,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash -181655210, now seen corresponding path program 1 times [2023-11-30 03:17:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328100694] [2023-11-30 03:17:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:18,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328100694] [2023-11-30 03:17:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328100694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218470617] [2023-11-30 03:17:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:18,189 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:18,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:18,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:18,191 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:17:18,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 494 transitions, 1435 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:18,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:18,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:17:18,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:18,857 INFO L124 PetriNetUnfolderBase]: 988/3079 cut-off events. [2023-11-30 03:17:18,857 INFO L125 PetriNetUnfolderBase]: For 5460/7169 co-relation queries the response was YES. [2023-11-30 03:17:18,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11358 conditions, 3079 events. 988/3079 cut-off events. For 5460/7169 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 20839 event pairs, 317 based on Foata normal form. 0/2792 useless extension candidates. Maximal degree in co-relation 9961. Up to 1335 conditions per place. [2023-11-30 03:17:18,891 INFO L140 encePairwiseOnDemand]: 660/662 looper letters, 37 selfloop transitions, 1 changer transitions 8/493 dead transitions. [2023-11-30 03:17:18,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 493 transitions, 1507 flow [2023-11-30 03:17:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1483 transitions. [2023-11-30 03:17:18,894 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7467270896273918 [2023-11-30 03:17:18,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1483 transitions. [2023-11-30 03:17:18,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1483 transitions. [2023-11-30 03:17:18,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:18,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1483 transitions. [2023-11-30 03:17:18,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 494.3333333333333) internal successors, (1483), 3 states have internal predecessors, (1483), 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) [2023-11-30 03:17:18,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:18,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:18,900 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -126 predicate places. [2023-11-30 03:17:18,901 INFO L500 AbstractCegarLoop]: Abstraction has has 496 places, 493 transitions, 1507 flow [2023-11-30 03:17:18,901 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:18,901 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:18,902 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:18,902 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:17:18,902 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:18,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1835905421, now seen corresponding path program 1 times [2023-11-30 03:17:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10121136] [2023-11-30 03:17:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10121136] [2023-11-30 03:17:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10121136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:17:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500128906] [2023-11-30 03:17:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:19,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:17:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:17:19,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:17:19,224 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 662 [2023-11-30 03:17:19,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 493 transitions, 1507 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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) [2023-11-30 03:17:19,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:19,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 662 [2023-11-30 03:17:19,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:22,790 INFO L124 PetriNetUnfolderBase]: 6659/12279 cut-off events. [2023-11-30 03:17:22,790 INFO L125 PetriNetUnfolderBase]: For 103857/104576 co-relation queries the response was YES. [2023-11-30 03:17:22,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63344 conditions, 12279 events. 6659/12279 cut-off events. For 103857/104576 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 91883 event pairs, 2468 based on Foata normal form. 0/11435 useless extension candidates. Maximal degree in co-relation 61553. Up to 8634 conditions per place. [2023-11-30 03:17:22,953 INFO L140 encePairwiseOnDemand]: 638/662 looper letters, 110 selfloop transitions, 20 changer transitions 8/489 dead transitions. [2023-11-30 03:17:22,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 489 transitions, 1759 flow [2023-11-30 03:17:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:17:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:17:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2472 transitions. [2023-11-30 03:17:22,957 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.622356495468278 [2023-11-30 03:17:22,957 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2472 transitions. [2023-11-30 03:17:22,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2472 transitions. [2023-11-30 03:17:22,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:22,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2472 transitions. [2023-11-30 03:17:22,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 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) [2023-11-30 03:17:22,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 662.0) internal successors, (4634), 7 states have internal predecessors, (4634), 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) [2023-11-30 03:17:22,966 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 662.0) internal successors, (4634), 7 states have internal predecessors, (4634), 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) [2023-11-30 03:17:22,966 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -125 predicate places. [2023-11-30 03:17:22,967 INFO L500 AbstractCegarLoop]: Abstraction has has 497 places, 489 transitions, 1759 flow [2023-11-30 03:17:22,967 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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) [2023-11-30 03:17:22,967 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:22,967 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:22,968 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:17:22,968 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:22,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash 214333512, now seen corresponding path program 1 times [2023-11-30 03:17:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098901767] [2023-11-30 03:17:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:22,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:22,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098901767] [2023-11-30 03:17:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098901767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:22,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068254785] [2023-11-30 03:17:23,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:23,000 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:23,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:23,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:23,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:23,001 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:17:23,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 489 transitions, 1759 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:23,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:23,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:17:23,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:26,331 INFO L124 PetriNetUnfolderBase]: 6659/12278 cut-off events. [2023-11-30 03:17:26,331 INFO L125 PetriNetUnfolderBase]: For 138298/139145 co-relation queries the response was YES. [2023-11-30 03:17:26,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70362 conditions, 12278 events. 6659/12278 cut-off events. For 138298/139145 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 91991 event pairs, 2468 based on Foata normal form. 0/11435 useless extension candidates. Maximal degree in co-relation 68433. Up to 8634 conditions per place. [2023-11-30 03:17:26,488 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 37 selfloop transitions, 2 changer transitions 8/488 dead transitions. [2023-11-30 03:17:26,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 488 transitions, 1835 flow [2023-11-30 03:17:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:17:26,491 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:17:26,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:17:26,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:17:26,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:26,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:17:26,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:17:26,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:26,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:26,496 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -124 predicate places. [2023-11-30 03:17:26,496 INFO L500 AbstractCegarLoop]: Abstraction has has 498 places, 488 transitions, 1835 flow [2023-11-30 03:17:26,496 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:26,497 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:26,497 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:26,497 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:17:26,497 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:26,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1704769461, now seen corresponding path program 1 times [2023-11-30 03:17:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:26,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557370928] [2023-11-30 03:17:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:26,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557370928] [2023-11-30 03:17:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557370928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:26,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:26,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:26,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622321509] [2023-11-30 03:17:26,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:26,528 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:26,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:26,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:26,530 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:17:26,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 488 transitions, 1835 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:26,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:26,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:17:26,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:29,614 INFO L124 PetriNetUnfolderBase]: 6791/10322 cut-off events. [2023-11-30 03:17:29,614 INFO L125 PetriNetUnfolderBase]: For 185513/185929 co-relation queries the response was YES. [2023-11-30 03:17:29,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76649 conditions, 10322 events. 6791/10322 cut-off events. For 185513/185929 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58960 event pairs, 1822 based on Foata normal form. 0/9786 useless extension candidates. Maximal degree in co-relation 74579. Up to 8799 conditions per place. [2023-11-30 03:17:29,828 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 40 selfloop transitions, 2 changer transitions 8/487 dead transitions. [2023-11-30 03:17:29,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 487 transitions, 1917 flow [2023-11-30 03:17:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:17:29,833 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:17:29,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:17:29,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:17:29,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:29,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:17:29,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:17:29,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:29,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:29,838 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -123 predicate places. [2023-11-30 03:17:29,839 INFO L500 AbstractCegarLoop]: Abstraction has has 499 places, 487 transitions, 1917 flow [2023-11-30 03:17:29,839 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:29,839 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:29,839 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:29,839 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:17:29,839 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:29,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1311756523, now seen corresponding path program 1 times [2023-11-30 03:17:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331539977] [2023-11-30 03:17:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:29,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:29,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331539977] [2023-11-30 03:17:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331539977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:29,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345098866] [2023-11-30 03:17:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:29,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:29,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:29,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:29,878 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:17:29,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 487 transitions, 1917 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:29,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:29,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:17:29,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:34,694 INFO L124 PetriNetUnfolderBase]: 8978/16076 cut-off events. [2023-11-30 03:17:34,695 INFO L125 PetriNetUnfolderBase]: For 242655/243759 co-relation queries the response was YES. [2023-11-30 03:17:34,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112905 conditions, 16076 events. 8978/16076 cut-off events. For 242655/243759 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 123615 event pairs, 2592 based on Foata normal form. 0/14954 useless extension candidates. Maximal degree in co-relation 110439. Up to 11612 conditions per place. [2023-11-30 03:17:34,942 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 62 selfloop transitions, 3 changer transitions 8/513 dead transitions. [2023-11-30 03:17:34,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 513 transitions, 2607 flow [2023-11-30 03:17:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1499 transitions. [2023-11-30 03:17:34,945 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7547834843907352 [2023-11-30 03:17:34,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1499 transitions. [2023-11-30 03:17:34,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1499 transitions. [2023-11-30 03:17:34,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:34,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1499 transitions. [2023-11-30 03:17:34,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 499.6666666666667) internal successors, (1499), 3 states have internal predecessors, (1499), 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) [2023-11-30 03:17:34,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:34,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:34,961 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -122 predicate places. [2023-11-30 03:17:34,961 INFO L500 AbstractCegarLoop]: Abstraction has has 500 places, 513 transitions, 2607 flow [2023-11-30 03:17:34,961 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:34,961 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:34,961 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:34,962 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:17:34,962 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:34,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash -412804517, now seen corresponding path program 1 times [2023-11-30 03:17:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:34,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760353654] [2023-11-30 03:17:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760353654] [2023-11-30 03:17:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760353654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298301131] [2023-11-30 03:17:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:34,990 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:34,991 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:17:34,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 513 transitions, 2607 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:34,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:34,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:17:34,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:39,700 INFO L124 PetriNetUnfolderBase]: 8957/16160 cut-off events. [2023-11-30 03:17:39,701 INFO L125 PetriNetUnfolderBase]: For 291725/294395 co-relation queries the response was YES. [2023-11-30 03:17:39,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122096 conditions, 16160 events. 8957/16160 cut-off events. For 291725/294395 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 125826 event pairs, 2949 based on Foata normal form. 0/14978 useless extension candidates. Maximal degree in co-relation 115243. Up to 11584 conditions per place. [2023-11-30 03:17:39,950 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 64 selfloop transitions, 2 changer transitions 8/512 dead transitions. [2023-11-30 03:17:39,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 512 transitions, 2737 flow [2023-11-30 03:17:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:17:39,968 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:17:39,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:17:39,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:17:39,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:39,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:17:39,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:17:39,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:39,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:39,988 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -121 predicate places. [2023-11-30 03:17:39,988 INFO L500 AbstractCegarLoop]: Abstraction has has 501 places, 512 transitions, 2737 flow [2023-11-30 03:17:39,989 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:39,989 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:39,989 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:39,989 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:17:39,990 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:39,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2118564867, now seen corresponding path program 1 times [2023-11-30 03:17:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993810594] [2023-11-30 03:17:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:40,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993810594] [2023-11-30 03:17:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993810594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379081709] [2023-11-30 03:17:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:40,030 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:40,031 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:17:40,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 512 transitions, 2737 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:40,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:40,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:17:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:44,730 INFO L124 PetriNetUnfolderBase]: 8957/16159 cut-off events. [2023-11-30 03:17:44,731 INFO L125 PetriNetUnfolderBase]: For 349411/352423 co-relation queries the response was YES. [2023-11-30 03:17:44,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131499 conditions, 16159 events. 8957/16159 cut-off events. For 349411/352423 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 125442 event pairs, 2949 based on Foata normal form. 0/14978 useless extension candidates. Maximal degree in co-relation 124163. Up to 11584 conditions per place. [2023-11-30 03:17:45,017 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 67 selfloop transitions, 2 changer transitions 8/511 dead transitions. [2023-11-30 03:17:45,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 511 transitions, 2873 flow [2023-11-30 03:17:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:17:45,037 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:17:45,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:17:45,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:17:45,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:45,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:17:45,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:17:45,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:45,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:45,042 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -120 predicate places. [2023-11-30 03:17:45,042 INFO L500 AbstractCegarLoop]: Abstraction has has 502 places, 511 transitions, 2873 flow [2023-11-30 03:17:45,043 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:45,043 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:45,043 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:45,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:17:45,043 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:45,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1263842657, now seen corresponding path program 1 times [2023-11-30 03:17:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:45,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584678724] [2023-11-30 03:17:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584678724] [2023-11-30 03:17:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584678724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276482482] [2023-11-30 03:17:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:45,099 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:45,101 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:17:45,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 511 transitions, 2873 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:45,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:45,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:17:45,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:49,844 INFO L124 PetriNetUnfolderBase]: 8957/16158 cut-off events. [2023-11-30 03:17:49,844 INFO L125 PetriNetUnfolderBase]: For 412269/415623 co-relation queries the response was YES. [2023-11-30 03:17:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140897 conditions, 16158 events. 8957/16158 cut-off events. For 412269/415623 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 125615 event pairs, 2949 based on Foata normal form. 0/14978 useless extension candidates. Maximal degree in co-relation 133083. Up to 11584 conditions per place. [2023-11-30 03:17:50,121 INFO L140 encePairwiseOnDemand]: 660/662 looper letters, 64 selfloop transitions, 1 changer transitions 8/510 dead transitions. [2023-11-30 03:17:50,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 510 transitions, 2999 flow [2023-11-30 03:17:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1483 transitions. [2023-11-30 03:17:50,123 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7467270896273918 [2023-11-30 03:17:50,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1483 transitions. [2023-11-30 03:17:50,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1483 transitions. [2023-11-30 03:17:50,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:50,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1483 transitions. [2023-11-30 03:17:50,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 494.3333333333333) internal successors, (1483), 3 states have internal predecessors, (1483), 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) [2023-11-30 03:17:50,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:50,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:50,130 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -119 predicate places. [2023-11-30 03:17:50,130 INFO L500 AbstractCegarLoop]: Abstraction has has 503 places, 510 transitions, 2999 flow [2023-11-30 03:17:50,130 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:17:50,130 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:50,130 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:50,130 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:17:50,130 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:50,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash -967337238, now seen corresponding path program 1 times [2023-11-30 03:17:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195341477] [2023-11-30 03:17:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:50,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195341477] [2023-11-30 03:17:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195341477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:50,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029935543] [2023-11-30 03:17:50,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:50,167 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:50,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:50,169 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:17:50,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 510 transitions, 2999 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:50,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:50,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:17:50,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:54,937 INFO L124 PetriNetUnfolderBase]: 8978/16072 cut-off events. [2023-11-30 03:17:54,937 INFO L125 PetriNetUnfolderBase]: For 487376/489000 co-relation queries the response was YES. [2023-11-30 03:17:54,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150618 conditions, 16072 events. 8978/16072 cut-off events. For 487376/489000 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 123942 event pairs, 2592 based on Foata normal form. 0/14954 useless extension candidates. Maximal degree in co-relation 147527. Up to 11612 conditions per place. [2023-11-30 03:17:55,233 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 64 selfloop transitions, 2 changer transitions 8/509 dead transitions. [2023-11-30 03:17:55,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 509 transitions, 3129 flow [2023-11-30 03:17:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:17:55,236 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:17:55,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:17:55,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:17:55,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:55,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:17:55,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:17:55,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:55,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:17:55,241 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -118 predicate places. [2023-11-30 03:17:55,241 INFO L500 AbstractCegarLoop]: Abstraction has has 504 places, 509 transitions, 3129 flow [2023-11-30 03:17:55,241 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:17:55,241 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:55,241 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:55,241 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:17:55,241 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:17:55,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1617384860, now seen corresponding path program 1 times [2023-11-30 03:17:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323118871] [2023-11-30 03:17:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:17:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323118871] [2023-11-30 03:17:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323118871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941290654] [2023-11-30 03:17:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:55,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:55,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:55,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:55,275 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:17:55,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 509 transitions, 3129 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:17:55,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:55,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:17:55,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:00,219 INFO L124 PetriNetUnfolderBase]: 8978/16071 cut-off events. [2023-11-30 03:18:00,219 INFO L125 PetriNetUnfolderBase]: For 561615/563373 co-relation queries the response was YES. [2023-11-30 03:18:00,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160049 conditions, 16071 events. 8978/16071 cut-off events. For 561615/563373 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 123767 event pairs, 2592 based on Foata normal form. 0/14954 useless extension candidates. Maximal degree in co-relation 156799. Up to 11612 conditions per place. [2023-11-30 03:18:00,580 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 67 selfloop transitions, 2 changer transitions 8/508 dead transitions. [2023-11-30 03:18:00,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 508 transitions, 3265 flow [2023-11-30 03:18:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:18:00,583 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:18:00,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:18:00,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:18:00,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:00,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:18:00,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:18:00,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:00,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:00,593 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -117 predicate places. [2023-11-30 03:18:00,593 INFO L500 AbstractCegarLoop]: Abstraction has has 505 places, 508 transitions, 3265 flow [2023-11-30 03:18:00,593 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:00,593 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:00,593 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:00,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:18:00,594 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:00,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1842578561, now seen corresponding path program 1 times [2023-11-30 03:18:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799303079] [2023-11-30 03:18:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:00,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:00,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799303079] [2023-11-30 03:18:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799303079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:00,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:00,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:00,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441672326] [2023-11-30 03:18:00,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:00,630 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:00,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:00,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:00,631 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:18:00,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 508 transitions, 3265 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:00,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:00,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:18:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:05,703 INFO L124 PetriNetUnfolderBase]: 9353/17345 cut-off events. [2023-11-30 03:18:05,703 INFO L125 PetriNetUnfolderBase]: For 658228/664259 co-relation queries the response was YES. [2023-11-30 03:18:05,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177546 conditions, 17345 events. 9353/17345 cut-off events. For 658228/664259 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 139027 event pairs, 2568 based on Foata normal form. 7/16026 useless extension candidates. Maximal degree in co-relation 160719. Up to 12215 conditions per place. [2023-11-30 03:18:06,058 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 114 selfloop transitions, 5 changer transitions 8/561 dead transitions. [2023-11-30 03:18:06,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 561 transitions, 5287 flow [2023-11-30 03:18:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2023-11-30 03:18:06,061 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7552870090634441 [2023-11-30 03:18:06,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2023-11-30 03:18:06,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2023-11-30 03:18:06,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:06,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2023-11-30 03:18:06,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 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) [2023-11-30 03:18:06,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:06,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:06,067 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -116 predicate places. [2023-11-30 03:18:06,067 INFO L500 AbstractCegarLoop]: Abstraction has has 506 places, 561 transitions, 5287 flow [2023-11-30 03:18:06,067 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:06,067 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:06,068 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:06,068 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:18:06,068 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:06,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1860872964, now seen corresponding path program 1 times [2023-11-30 03:18:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597923345] [2023-11-30 03:18:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597923345] [2023-11-30 03:18:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597923345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:06,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817761640] [2023-11-30 03:18:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:06,097 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:06,099 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:18:06,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 561 transitions, 5287 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:18:06,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:06,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:18:06,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:11,202 INFO L124 PetriNetUnfolderBase]: 9356/17212 cut-off events. [2023-11-30 03:18:11,202 INFO L125 PetriNetUnfolderBase]: For 750532/753872 co-relation queries the response was YES. [2023-11-30 03:18:11,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187323 conditions, 17212 events. 9356/17212 cut-off events. For 750532/753872 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 136619 event pairs, 2292 based on Foata normal form. 8/15968 useless extension candidates. Maximal degree in co-relation 182167. Up to 12219 conditions per place. [2023-11-30 03:18:11,701 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 118 selfloop transitions, 2 changer transitions 8/560 dead transitions. [2023-11-30 03:18:11,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 560 transitions, 5525 flow [2023-11-30 03:18:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:18:11,703 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:18:11,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:18:11,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:18:11,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:11,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:18:11,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:18:11,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:11,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:11,707 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -115 predicate places. [2023-11-30 03:18:11,708 INFO L500 AbstractCegarLoop]: Abstraction has has 507 places, 560 transitions, 5525 flow [2023-11-30 03:18:11,708 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:18:11,708 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:11,708 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:11,708 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:18:11,708 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:11,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1547541937, now seen corresponding path program 1 times [2023-11-30 03:18:11,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:11,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008253163] [2023-11-30 03:18:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:11,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008253163] [2023-11-30 03:18:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008253163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359905573] [2023-11-30 03:18:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:11,739 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:11,740 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:18:11,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 560 transitions, 5525 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:11,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:11,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:18:11,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:16,942 INFO L124 PetriNetUnfolderBase]: 9356/17183 cut-off events. [2023-11-30 03:18:16,943 INFO L125 PetriNetUnfolderBase]: For 843341/846468 co-relation queries the response was YES. [2023-11-30 03:18:17,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197141 conditions, 17183 events. 9356/17183 cut-off events. For 843341/846468 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 135973 event pairs, 2326 based on Foata normal form. 6/15949 useless extension candidates. Maximal degree in co-relation 191747. Up to 12219 conditions per place. [2023-11-30 03:18:17,339 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 121 selfloop transitions, 2 changer transitions 8/559 dead transitions. [2023-11-30 03:18:17,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 559 transitions, 5769 flow [2023-11-30 03:18:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:18:17,342 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:18:17,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:18:17,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:18:17,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:17,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:18:17,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:18:17,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:17,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:17,346 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -114 predicate places. [2023-11-30 03:18:17,346 INFO L500 AbstractCegarLoop]: Abstraction has has 508 places, 559 transitions, 5769 flow [2023-11-30 03:18:17,346 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:17,346 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:17,346 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:17,346 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:18:17,346 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:17,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1443575055, now seen corresponding path program 1 times [2023-11-30 03:18:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152820113] [2023-11-30 03:18:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152820113] [2023-11-30 03:18:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152820113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759026312] [2023-11-30 03:18:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:17,376 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:17,377 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:18:17,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 559 transitions, 5769 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:17,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:17,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:18:17,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:22,679 INFO L124 PetriNetUnfolderBase]: 9356/17182 cut-off events. [2023-11-30 03:18:22,679 INFO L125 PetriNetUnfolderBase]: For 941550/944915 co-relation queries the response was YES. [2023-11-30 03:18:22,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206982 conditions, 17182 events. 9356/17182 cut-off events. For 941550/944915 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 136099 event pairs, 2326 based on Foata normal form. 6/15949 useless extension candidates. Maximal degree in co-relation 201355. Up to 12219 conditions per place. [2023-11-30 03:18:23,078 INFO L140 encePairwiseOnDemand]: 660/662 looper letters, 118 selfloop transitions, 1 changer transitions 8/558 dead transitions. [2023-11-30 03:18:23,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 558 transitions, 6003 flow [2023-11-30 03:18:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1483 transitions. [2023-11-30 03:18:23,080 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7467270896273918 [2023-11-30 03:18:23,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1483 transitions. [2023-11-30 03:18:23,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1483 transitions. [2023-11-30 03:18:23,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:23,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1483 transitions. [2023-11-30 03:18:23,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 494.3333333333333) internal successors, (1483), 3 states have internal predecessors, (1483), 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) [2023-11-30 03:18:23,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:23,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:23,084 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -113 predicate places. [2023-11-30 03:18:23,084 INFO L500 AbstractCegarLoop]: Abstraction has has 509 places, 558 transitions, 6003 flow [2023-11-30 03:18:23,085 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:23,085 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:23,085 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:23,085 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:18:23,085 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:23,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash 937598698, now seen corresponding path program 1 times [2023-11-30 03:18:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819309126] [2023-11-30 03:18:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819309126] [2023-11-30 03:18:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819309126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556434382] [2023-11-30 03:18:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:23,119 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:23,120 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:18:23,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 558 transitions, 6003 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:18:23,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:23,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:18:23,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:28,562 INFO L124 PetriNetUnfolderBase]: 9347/17248 cut-off events. [2023-11-30 03:18:28,562 INFO L125 PetriNetUnfolderBase]: For 1055665/1060924 co-relation queries the response was YES. [2023-11-30 03:18:28,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216646 conditions, 17248 events. 9347/17248 cut-off events. For 1055665/1060924 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 137053 event pairs, 2828 based on Foata normal form. 1/15980 useless extension candidates. Maximal degree in co-relation 196250. Up to 12207 conditions per place. [2023-11-30 03:18:28,948 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 118 selfloop transitions, 2 changer transitions 8/557 dead transitions. [2023-11-30 03:18:28,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 557 transitions, 6241 flow [2023-11-30 03:18:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:18:28,951 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:18:28,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:18:28,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:18:28,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:28,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:18:28,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:18:28,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:28,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:28,955 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -112 predicate places. [2023-11-30 03:18:28,955 INFO L500 AbstractCegarLoop]: Abstraction has has 510 places, 557 transitions, 6241 flow [2023-11-30 03:18:28,955 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:18:28,955 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:28,955 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:28,955 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:18:28,955 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:28,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1298301176, now seen corresponding path program 1 times [2023-11-30 03:18:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115670358] [2023-11-30 03:18:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115670358] [2023-11-30 03:18:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115670358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073975276] [2023-11-30 03:18:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:28,988 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:28,990 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:18:28,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 557 transitions, 6241 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:28,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:28,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:18:28,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:34,636 INFO L124 PetriNetUnfolderBase]: 9356/17124 cut-off events. [2023-11-30 03:18:34,636 INFO L125 PetriNetUnfolderBase]: For 1148200/1151678 co-relation queries the response was YES. [2023-11-30 03:18:34,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226615 conditions, 17124 events. 9356/17124 cut-off events. For 1148200/1151678 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 135252 event pairs, 2218 based on Foata normal form. 6/15909 useless extension candidates. Maximal degree in co-relation 220515. Up to 12219 conditions per place. [2023-11-30 03:18:35,200 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 121 selfloop transitions, 2 changer transitions 8/556 dead transitions. [2023-11-30 03:18:35,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 556 transitions, 6485 flow [2023-11-30 03:18:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:18:35,202 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:18:35,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:18:35,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:18:35,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:35,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:18:35,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:18:35,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:35,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:35,206 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -111 predicate places. [2023-11-30 03:18:35,206 INFO L500 AbstractCegarLoop]: Abstraction has has 511 places, 556 transitions, 6485 flow [2023-11-30 03:18:35,206 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:35,206 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:35,206 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:35,206 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 03:18:35,206 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:35,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash -337614493, now seen corresponding path program 1 times [2023-11-30 03:18:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356799611] [2023-11-30 03:18:35,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:35,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356799611] [2023-11-30 03:18:35,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356799611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548711760] [2023-11-30 03:18:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:35,241 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:35,242 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:18:35,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 556 transitions, 6485 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:35,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:35,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:18:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:41,149 INFO L124 PetriNetUnfolderBase]: 9455/18731 cut-off events. [2023-11-30 03:18:41,150 INFO L125 PetriNetUnfolderBase]: For 1183874/1195373 co-relation queries the response was YES. [2023-11-30 03:18:41,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240914 conditions, 18731 events. 9455/18731 cut-off events. For 1183874/1195373 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 161860 event pairs, 2288 based on Foata normal form. 10/17279 useless extension candidates. Maximal degree in co-relation 231509. Up to 12439 conditions per place. [2023-11-30 03:18:41,629 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 210 selfloop transitions, 9 changer transitions 8/655 dead transitions. [2023-11-30 03:18:41,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 655 transitions, 11427 flow [2023-11-30 03:18:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1499 transitions. [2023-11-30 03:18:41,631 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7547834843907352 [2023-11-30 03:18:41,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1499 transitions. [2023-11-30 03:18:41,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1499 transitions. [2023-11-30 03:18:41,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:41,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1499 transitions. [2023-11-30 03:18:41,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 499.6666666666667) internal successors, (1499), 3 states have internal predecessors, (1499), 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) [2023-11-30 03:18:41,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:41,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:41,635 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -110 predicate places. [2023-11-30 03:18:41,635 INFO L500 AbstractCegarLoop]: Abstraction has has 512 places, 655 transitions, 11427 flow [2023-11-30 03:18:41,635 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:41,635 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:41,635 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:41,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 03:18:41,636 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:41,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -811600568, now seen corresponding path program 1 times [2023-11-30 03:18:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38251248] [2023-11-30 03:18:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:41,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38251248] [2023-11-30 03:18:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38251248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:41,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:41,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:41,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960377010] [2023-11-30 03:18:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:41,671 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:41,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:41,672 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 662 [2023-11-30 03:18:41,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 655 transitions, 11427 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:18:41,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:41,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 662 [2023-11-30 03:18:41,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:48,192 INFO L124 PetriNetUnfolderBase]: 9455/18743 cut-off events. [2023-11-30 03:18:48,192 INFO L125 PetriNetUnfolderBase]: For 1317038/1329282 co-relation queries the response was YES. [2023-11-30 03:18:48,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250894 conditions, 18743 events. 9455/18743 cut-off events. For 1317038/1329282 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 161362 event pairs, 2388 based on Foata normal form. 7/17292 useless extension candidates. Maximal degree in co-relation 224569. Up to 12439 conditions per place. [2023-11-30 03:18:48,641 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 218 selfloop transitions, 2 changer transitions 8/654 dead transitions. [2023-11-30 03:18:48,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 654 transitions, 11865 flow [2023-11-30 03:18:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2023-11-30 03:18:48,643 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7457200402819738 [2023-11-30 03:18:48,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2023-11-30 03:18:48,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2023-11-30 03:18:48,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:48,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2023-11-30 03:18:48,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 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) [2023-11-30 03:18:48,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:48,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:48,647 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -109 predicate places. [2023-11-30 03:18:48,647 INFO L500 AbstractCegarLoop]: Abstraction has has 513 places, 654 transitions, 11865 flow [2023-11-30 03:18:48,647 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 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) [2023-11-30 03:18:48,647 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:48,647 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:48,647 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-30 03:18:48,647 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:48,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 734611223, now seen corresponding path program 1 times [2023-11-30 03:18:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144161855] [2023-11-30 03:18:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144161855] [2023-11-30 03:18:48,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144161855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:48,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:48,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656018016] [2023-11-30 03:18:48,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:48,682 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:48,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:48,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:48,684 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 662 [2023-11-30 03:18:48,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 654 transitions, 11865 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:48,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:48,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 662 [2023-11-30 03:18:48,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:18:55,107 INFO L124 PetriNetUnfolderBase]: 9455/18759 cut-off events. [2023-11-30 03:18:55,108 INFO L125 PetriNetUnfolderBase]: For 1413456/1426661 co-relation queries the response was YES. [2023-11-30 03:18:55,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260881 conditions, 18759 events. 9455/18759 cut-off events. For 1413456/1426661 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 162316 event pairs, 2291 based on Foata normal form. 10/17297 useless extension candidates. Maximal degree in co-relation 250763. Up to 12439 conditions per place. [2023-11-30 03:18:55,812 INFO L140 encePairwiseOnDemand]: 659/662 looper letters, 221 selfloop transitions, 2 changer transitions 8/653 dead transitions. [2023-11-30 03:18:55,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 653 transitions, 12309 flow [2023-11-30 03:18:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:18:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:18:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1475 transitions. [2023-11-30 03:18:55,815 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74269889224572 [2023-11-30 03:18:55,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1475 transitions. [2023-11-30 03:18:55,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1475 transitions. [2023-11-30 03:18:55,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:18:55,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1475 transitions. [2023-11-30 03:18:55,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 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) [2023-11-30 03:18:55,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:55,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 662.0) internal successors, (2648), 4 states have internal predecessors, (2648), 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) [2023-11-30 03:18:55,820 INFO L307 CegarLoopForPetriNet]: 622 programPoint places, -108 predicate places. [2023-11-30 03:18:55,820 INFO L500 AbstractCegarLoop]: Abstraction has has 514 places, 653 transitions, 12309 flow [2023-11-30 03:18:55,820 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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) [2023-11-30 03:18:55,820 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:18:55,820 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:18:55,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-30 03:18:55,820 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 300 more)] === [2023-11-30 03:18:55,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:18:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 263732514, now seen corresponding path program 1 times [2023-11-30 03:18:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:18:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132815237] [2023-11-30 03:18:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:18:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:18:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:18:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:18:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:18:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132815237] [2023-11-30 03:18:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132815237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:18:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:18:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:18:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911409257] [2023-11-30 03:18:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:18:55,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:18:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:18:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:18:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:18:55,931 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 662 [2023-11-30 03:18:55,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 653 transitions, 12309 flow. Second operand has 3 states, 3 states have (on average 487.3333333333333) internal successors, (1462), 3 states have internal predecessors, (1462), 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) [2023-11-30 03:18:55,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:18:55,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 662 [2023-11-30 03:18:55,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand